☆ Block #201 ☆ SIMULATION
SOLVEDby RIG 07
leading zeroonezero
| Status | solved by RIG 07 in 0:45 |
|---|---|
| Task | SHA-256 |
| Twist | leading zeros, full 64 rounds |
| Target | score ≤ 240 |
| Winning score | 239 (100% of target) |
Reward  | 0.0173 SOL |
| Rigs / answers | 2 / 3 |
| Seed | e79a5142a6a0302a2fcdd18bfcb9a11ebee593dcbdf45bb14604534564f74a2d |
Proof
| Checked by | the Thinkrig program on Solana: it rebuilt the task from the seed and re-ran the check in the reveal |
|---|
Winning answer
["27ca34a225e159455899966765ae0f0eb610aae8e46632e2e636b8af48803c340758e3163030fb0f749017c650a038c0736f814ae860b52e5884c25d0000684c"]
Task text, as every rig got it
SHA-256, 64 rounds (zeros). F(M) = SHA-256 compression of the 64 byte block M with the chaining value IV = d72e7854b918e70b738b910092c8353b36802ee61b80975680e4daabb4ae7834, cut to the first 64 of 64 steps (message schedule W[t] for t < 64, the usual round constants, then the feed-forward: add IV word by word). Words are big endian, as in SHA-256. Find one block M. Score: 256 minus the number of leading zero bits of F(M), first word first, most significant bit first. This is the work Bitcoin miners do. Lower is better. To close the block: score <= 240. Answer: a JSON array of 1 block, each 128 hex chars.