
The chain for those who actually build. Python on-chain. Secured by Bitcoin. Powered by $HTR
- Tweets5K
- Following85
- Followers64.3K
- Likes2.5K

ALT Pedersen Commitments Challenge 1. Let G generate a group of prime order q, and let H₁, H₂ be the points of their tokens (the same token or two different ones). Fix any amounts v₁, v₂, and pick r₁, r₂ independently and uniformly at random mod q. Commitments: C₁ = v₁·H₁ + r₁·G and C₂ = v₂·H₂ + r₂·G. Prove that P(C₁ = C₂) = 1/q. What it means: unlike a plain hash of the amount, equal amounts do not give equal commitments. Two payments of 40 USDT collide with probability only 1/q, about 2⁻²⁵⁶ on secp256k1. This alone does not prove that a commitment reveals nothing about its amount. That takes a stronger result: perfect hiding. Answer in the replies. @msbrogli

ALT The planes were parked. A randomized trial of parachutes. Two panels. Top, "In the trial": a plane parked on the ground, average altitude 0.6 m, speed 0 km/h, 23 people enrolled. Bottom, "Screened, did not take part": a plane in the sky, 9,146 m, 800 km/h, the other 69 screened. Source: Yeh et al., BMJ 2018;363:k5094.







