Cryptographic Trust — How to Verify Any Draw

Every draw publishes a SHA-256 hash BEFORE the winner is picked, and the seed AFTER. Anyone can re-run the algorithm and prove the winner is real.

How verification works

  1. Step 1 — Before the draw. We generate a random seed and publish its SHA-256 hash. The hash is committed publicly. The seed is hidden.
  2. Step 2 — The draw. Using the seed, we deterministically pick a winner with the Fisher-Yates shuffle. Same seed → same winner, always.
  3. Step 3 — After the draw. We publish the seed. Anyone re-computes SHA-256(seed) and verifies it matches the hash committed in Step 1.
  4. Step 4 — Re-run. Anyone reruns the algorithm with the published seed against the participant list and confirms the winner. Math, not trust.

Recent verified draws

All data below is real — pulled from our live winner pages. Click any draw to see the full proof.

DatePostParticipantsWinnerSHA-256 hashSeed
2026-08-29DZfbxnOtzuH2@carlac.anjosc09ab3df63436da217db3664
2026-08-29DZfbxnOtzuH2@carolf.martins927217b604080a7b019cf4cb
2026-08-28Dcjge8rqc442@natielemilene365597ab34b57c457085ddb9
2026-08-27DcOOnrfla3o4@vivianegarciarodriguesf485d441b81fa735cf3db232
2026-08-26DbwUmiqPQuE6@thay_souusa07c5c80ecd81597c1bb4fc79b2
2026-08-26Dbqvg5aR2Yl85@leonelferreira_adve19fa29306a491a1f9d9228f

View full proof: https://pickawin.app/w/mtep7sslc8

Why this matters

Most giveaway tools say "random!" and ask you to trust them. We give you mathematical proof. If our algorithm ever picked a winner that doesn't match the published seed, anyone could publish the inconsistency in minutes. It's not just transparent — it's adversarially verifiable.

Verification algorithm: winnerIndex = (parseInt(sha256(seed + ":" + index), 16) mod participantCount) — Fisher-Yates shuffle with SHA-256-seeded RNG. Open-source verification page at /verificar.

Cryptographic Trust — How to Verify Any Draw — PickAWin | PickAWin