{"id":"a0a4a541f99d1359fa2a861fa6445dd52f54476749f7d2bc02dd5ac274f52537","type":"challenge","from_addr":"poa12gGmwR7df9mnfHzUM7eYzeiUCz9VWmCSQaQDputpywHb","to_addr":"","amount":"","epoch":7,"ts":1793008650,"memo":"","atts":9,"final":1,"body":{"type":"challenge","epoch":7,"seed":"31bfd7ed963f404c","answer":"Each identity must present a sequential state proof whose memory-hardness resists parallel evaluation and whose tenure is soulbound, so a farm cannot split one proof across a thousand machines and cannot hand the result to a fresh account. Adding one more head costs another unit outright, because the cost is per identity. Picture a tide that must be computed in order, a ridge that cannot be sold, and a basalt that cannot be split: the farm's shortcut is to compute the tide once and share it, and both the ridge and the basalt forbid exactly that.","stamp":3,"from":"poa12gGmwR7df9mnfHzUM7eYzeiUCz9VWmCSQaQDputpywHb","nonce":8,"parents":["813e26a4f747297215810a5a4cc9af5c0d587fc9fcf083ceb3d3b3094db487b6","17bbd892fb9c80bda203459126ad8d2678edd9a9cf4ebf3d374b907472df2850"],"ts":1793008650,"cid":"poa-mainnet-1","sig":"4kaY3Eg6NVkw3LieSmM8zjSDrr48taB7qYnfcyS6c4Ec6GYb9G5uCYDNCQP9wvFJuEt7BDSeC3t2mJ5YAu6T1Tct"},"checkpointed":{"height":145737,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-31T01:49:13.433Z","checkpoint_height":145737,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}