Winners

Campaign 1, 9 Nov to 20 Dec 2026. Instant prizes are listed as they are won. Every prize is checked against the promotion terms before it is sent. We show first names, last initials and states only, and a name only once its winner has claimed.

Gamer

No Gamer mid prize has been won yet.

Bonus packs won: 0

Garage

No Garage mid prize has been won yet.

Bonus packs won: 0

Main Character

No Main Character mid prize has been won yet.

Bonus packs won: 0

Draw results

The headline prize draws are on 23 Dec 2026. The results will be published here.

How the winning packs were fixed in advance

Before the promotion opened, a secret random number was generated in front of an independent supervisor. It decides which places in each series' pool win. Nobody who can buy a pack can see it. This is its fingerprint (SHA-256):

fadda66eec9ec08d24db70e7f323a673a94c02be898865cdfe284a91adc5c2a5

A fingerprint can't be turned back into the secret, and any change to the secret changes the fingerprint completely. So once it is published, the winning places can't be changed.

After the promotion closes on 20 Dec, we publish the secret here and on the winners page.

Check it yourself

The SHA-256 of the secret must equal the fingerprint. On a Mac or Linux, run printf %s 'SECRET' | shasum -a 256, or paste the secret here:

The method, step by step

Each series has its own pool. Its places are numbered in the order payments are confirmed. Block b holds places 100b + 1 to 100b + 100 (block 0 is places 1 to 100).
Random numbers for a key K: compute HMAC-SHA256 with the secret (as text) as the key and "K#0" as the message, then "K#1", "K#2" and so on. Read each 32-byte result as eight 4-byte big-endian unsigned integers, in order, and divide each by 2³².
Winning places in block b: list the positions 0 to 99. Using the numbers for the key "Series:block:b" (for example "Gamer:block:0" or "Main Character:block:3"), for i from 99 down to 1, take the next number r, let j = floor(r × (i + 1)), and swap positions i and j. The first 10 positions in the list are the winners. Position k is place 100b + k + 1.
The mid prize: each run of 600 places holds exactly one. For run s (run 0 starts at block 0), using the numbers for the key "Series:span:s", the first number r1 picks the block, s × n + floor(r1 × n), where n is the number of blocks in a run. The second, r2, picks which of that block's winners, in the order of step 3: floor(r2 × 10). Every other winning place holds a bonus prize.

Winners

Gamer

No Gamer mid prize has been won yet.

Bonus packs won: 0

Garage

No Garage mid prize has been won yet.

Bonus packs won: 0

Main Character

No Main Character mid prize has been won yet.

Bonus packs won: 0

How the winning packs were fixed in advance

fadda66eec9ec08d24db70e7f323a673a94c02be898865cdfe284a91adc5c2a5

A fingerprint can't be turned back into the secret, and any change to the secret changes the fingerprint completely. So once it is published, the winning places can't be changed.

After the promotion closes on 20 Dec, we publish the secret here and on the winners page.

Check it yourself

The SHA-256 of the secret must equal the fingerprint. On a Mac or Linux, run printf %s 'SECRET' | shasum -a 256, or paste the secret here:

The method, step by step

Each series has its own pool. Its places are numbered in the order payments are confirmed. Block b holds places 100b + 1 to 100b + 100 (block 0 is places 1 to 100).
Random numbers for a key K: compute HMAC-SHA256 with the secret (as text) as the key and "K#0" as the message, then "K#1", "K#2" and so on. Read each 32-byte result as eight 4-byte big-endian unsigned integers, in order, and divide each by 2³².
Winning places in block b: list the positions 0 to 99. Using the numbers for the key "Series:block:b" (for example "Gamer:block:0" or "Main Character:block:3"), for i from 99 down to 1, take the next number r, let j = floor(r × (i + 1)), and swap positions i and j. The first 10 positions in the list are the winners. Position k is place 100b + k + 1.
The mid prize: each run of 600 places holds exactly one. For run s (run 0 starts at block 0), using the numbers for the key "Series:span:s", the first number r1 picks the block, s × n + floor(r1 × n), where n is the number of blocks in a run. The second, r2, picks which of that block's winners, in the order of step 3: floor(r2 × 10). Every other winning place holds a bonus prize.