{"id":"f2b13c81724a77375c557d2dfaa1e482b8932187cc438e69ebda76c812501edd","type":"challenge","from_addr":"poa13kWV7eA6zP3Wb7MfE5vbb6siQoTd26b451WuPx4p7qme","to_addr":"","amount":"","epoch":24,"ts":1793385009,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":24,"seed":"209f075a91ed5612","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 dune that must be computed in order, a trellis that cannot be sold, and a summit that cannot be split: the farm's shortcut is to compute the dune once and share it, and both the trellis and the summit forbid exactly that.","stamp":0,"from":"poa13kWV7eA6zP3Wb7MfE5vbb6siQoTd26b451WuPx4p7qme","nonce":21,"parents":["e57264ceb70b6de11866c5dc2be2f887c699dc365032975df00114bba7e05f63","09e90c39cb6549ab01b7d18f9f0fea55ebf8b6775a7662d76e4e53286a4c4d19"],"ts":1793385009,"cid":"poa-mainnet-1","sig":"4unGADwSjphfnr8JkUwWsUPvqfY7ZtWgY2roiykyVUcU6nKZspbMCdEPB996pnJbsop5oqpSf3WWxigJMEutd1sj"},"checkpointed":{"height":245357,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-11-03T15:56:15.142Z","checkpoint_height":245357,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}