Automatic & Live Draws Free postal entry — equal chance Provably fair · 18+ · Great Britain only
Open Verification

Draw Verification

THE SABBAT WORLDS CRUSADE – PREMIUM A4 HARDBACK

Provably fair — cryptographic Draw complete

Draw complete — independently verifiable

This draw used a cryptographic commitment scheme. The draw secret was generated before ticket sales began, its sha256 hash (the commitment hash) was published, and the secret was only revealed after the draw. This proves the winner selection could not have been influenced by ticket sales.

Draw Result

Winner
Law, Kent
Winning ticket
#7
Entries in pool
17 (all entrants)
Winner index
3 (0-based)
Draw executed
18 Aug 2026, 8:40 PM
Entropy source
secrets.SystemRandom (instant-win positions at setup)
Fairness mechanism
SHA-256 commit-reveal — selection by sha256(legion-draw-v1:draw:draw_secret:pool_hash:drand_randomness:counter) rejection sampling

How This Result Was Produced

7 steps, each one checkable against the values published below. Nothing here depends on trusting us — every input is shown.

Verify commitment was published before the draw

This sha256 hash was published when the competition was created. It proves the draw_secret could not have been changed after tickets were sold.

634be12aa19cac4f7844fadaf0d0baf3d39708123a1f45cb158da7bd852d890e

Verify the pool-freeze commitment was published before the beacon round

sha256 of the exact UTF-8 string 'legion-draw-v1:pool_freeze:' + pool_hash + ':' + drand_chain_hash + ':' + str(round_number) — colon-separated, no spaces, no trailing newline. Published before the targeted round resolved, it pins both the entry pool and the round while the round's randomness was still unknowable. Rebuild it from this page's published values with the command below.

95f0f98cb868aa2953794ae421ad8e45b42583778468e5760fe4953cac799887
python3 -c "import hashlib; print(hashlib.sha256('legion-draw-v1:pool_freeze:fc04be5f0edb730ab88ede0c29a03644bca4797ffffae3157490e119eac1ad1d:52db9ba70e0cc0f6eaf7803dd07447a1f5477735fd3f661792ba94600c84e971:31426119'.encode()).hexdigest())"

Verify draw_secret matches commitment_hash

The draw_secret is revealed below. sha256(draw_secret) is shown — it must equal the commitment_hash in step 1.

draw_secret (input)

fdc44bf15e8afb6f5d8de547fe6157c1c40728a8f48057a76fa6bfa0ca301b15

sha256(draw_secret) must equal step 1

634be12aa19cac4f7844fadaf0d0baf3d39708123a1f45cb158da7bd852d890e

Verify the entry pool hash

sha256 of every ticket number in the draw pool, in ascending numeric order, joined with commas and no spaces.

fc04be5f0edb730ab88ede0c29a03644bca4797ffffae3157490e119eac1ad1d

Verify the drand beacon randomness

Round 31426119 of the public drand randomness beacon (chain 52db9ba70e0cc0f6eaf7803dd07447a1f5477735fd3f661792ba94600c84e971). This value is published independently by multiple operators and could not have been known when the pool above was frozen. Check it yourself: fetch https://api.drand.sh/52db9ba70e0cc0f6eaf7803dd07447a1f5477735fd3f661792ba94600c84e971/public/31426119, hex-decode the response's 'signature' field into raw bytes, then compute sha256 of those bytes — it must match the value shown here. (Hashing the ASCII hex text of the signature instead of the decoded bytes gives a different, wrong answer.) The command below does exactly that.

582e022a1991fec922446de12093ef8d9f6b75fb7be39cdfae63889ab4d04137
python3 -c "import hashlib, json, urllib.request; r = json.load(urllib.request.urlopen('https://api.drand.sh/52db9ba70e0cc0f6eaf7803dd07447a1f5477735fd3f661792ba94600c84e971/public/31426119')); print(hashlib.sha256(bytes.fromhex(r['signature'])).hexdigest())"

Verify the beacon's BLS signature

Before accepting the randomness above, the platform checked drand's BLS12-381 signature for this round against this chain public key — a relay can withhold a round but cannot forge one without drand's private key. Fetch the round's 'signature' field from the URL above and verify e(H(round_bytes), public_key) == e(signature, G2_generator) yourself with any BLS12-381 library; source: https://drand.love/developer/http-api/.

83cf0f2896adee7eb8b5f01fcad3912212c437e0073e911fb90022d3e760183c8c4b450b6a0a6c3ac6a5776a2d1064510d1fec758c921cc22b0e17e63aaf4bcb5ed66304de9cf809bd274ca73bab4af5a6e9c76a4bc09e76eae8991ef5ece45a

Reproduce the winner selection (rejection sampling)

Starting at counter=0, compute sha256(f'legion-draw-v1:draw:{draw_secret}:{pool_hash}:{drand_randomness}:{counter}') as a 256-bit integer. Let limit be the largest multiple of N below 2^256. If the value is >= limit, increment counter and retry. Otherwise winner_index = value mod N.

counter=0, winner_index=3

Check It Yourself

Run every check in your own browser. It recomputes the hashes and the winner selection locally from the values published on this page, and fetches the drand round directly from the public relays — nothing is sent to our servers, so a pass cannot depend on trusting us.

  1. Confirm sha256(draw_secret) equals the commitment hash in step 1.
  2. Confirm the sha256 of the entry pool below equals the pool hash in step 3. Hash the text exactly as shown — ticket numbers in ascending numeric order, separated by commas, with no spaces and no trailing newline.

    Entry pool — ticket numbers in ascending numeric order

    3,5,6,7,8,9,11,13,18,20,22,23,29,35,36,39,47
  3. Run the pre-filled command below to reproduce the beacon-seeded rejection-sampling winner index (counter=?, expected winner_index=3). This folds in the drand beacon randomness from the step above alongside the draw secret and pool hash, so the winner could not have been known until that round resolved.
    python3 - <<'PY'
    import hashlib
    draw_secret = 'fdc44bf15e8afb6f5d8de547fe6157c1c40728a8f48057a76fa6bfa0ca301b15'
    pool_hash = 'fc04be5f0edb730ab88ede0c29a03644bca4797ffffae3157490e119eac1ad1d'
    beacon_randomness = '582e022a1991fec922446de12093ef8d9f6b75fb7be39cdfae63889ab4d04137'
    total_entries = 17
    counter = 0
    limit = (1 << 256) - ((1 << 256) % total_entries)
    while True:
        seed = hashlib.sha256(f'legion-draw-v1:draw:{draw_secret}:{pool_hash}:{beacon_randomness}:{counter}'.encode()).digest()
        candidate = int.from_bytes(seed[:32], 'big')
        if candidate < limit:
            print(f'counter={counter} winner_index={candidate % total_entries}')
            break
        counter += 1
    PY

Full Entry List

All sold tickets with entry method and optional-question answer status (no personal names). Download it to cross-reference ticket numbers against the draw pool; the "In Main Draw" column marks which rows formed it.

Download entry list CSV

Independent Timestamp Proof

Each commitment hash is anchored to the Bitcoin blockchain via OpenTimestamps. A confirmed proof establishes the hash existed before the Bitcoin block that attests it — checkable without trusting our records. Save the commitment hash to a file and check the proof with the free ots tool: printf '%s' 'COMMITMENT_HASH' > commitment.txt && ots verify -f commitment.txt proof.ots

Draw commitment — anchored in Bitcoin 10 Aug 2026 15:05 UTC

634be12aa19cac4f7844fadaf0d0baf3d39708123a1f45cb158da7bd852d890e Download OTS proof

Instant win commitment — anchored in Bitcoin 11 Aug 2026 00:05 UTC

e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855 Download OTS proof

Pool freeze commitment — anchored in Bitcoin 18 Aug 2026 23:05 UTC

95f0f98cb868aa2953794ae421ad8e45b42583778468e5760fe4953cac799887

What this proof does and does not show: Bitcoin confirmation takes hours, while the targeted drand round resolves seconds after the pool freeze — so a confirmed proof here demonstrates the pool-freeze commitment existed before its attesting block, not that the freeze happened before the drand round. The freeze-before-round ordering rests on the commitment having been published before the round resolved (step 2 above) and on our audit records.

Download OTS proof