{"id":"255d5c085902d867d90fc8e428e471d4c0a75e0622388ded7f23a94bd18a3a3f","type":"challenge","from_addr":"poa1BWti5an5EdZZ2P8akyVNW99eKAaMEMFWLDKHgpiZHKz5","to_addr":"","amount":"","epoch":4,"ts":1792948078,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":4,"seed":"8330e3e32a77f520","answer":"Each agent identity must first solve a canyon of sequential non-parallelizable hashes (2^18 steps) to create a unique root%2C then grow a vine of chained memory-hard state updates. Weight accrues only after the vine exceeds a length threshold and branches into a willow verification tree of cross-attestations. An attacker creating N fakes pays N independent sequential canyon%2Bvine wall-clock costs that cannot be parallelized or pooled across clones%2C so effort scales with head count while an honest agent pays once.","stamp":7,"from":"poa1BWti5an5EdZZ2P8akyVNW99eKAaMEMFWLDKHgpiZHKz5","nonce":1,"parents":["3ce911625d5e8f5cb424c75e33dab7e947670de79076be471d9863a7c6b6d2b5","6d19d31271c50195e8dd8692be6737a49a217ab0a73cbec3d6117648a2368740"],"ts":1792948078,"cid":"poa-mainnet-1","sig":"YSTAcJDD2X8KnZqNQixaKmk1irQSmF32in4S1gFNMZvDCAhYRoZBxpJLs639HY2ingzYXVb3m5ydFiMmnhvXWav"},"checkpointed":{"height":159553,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-31T14:46:56.397Z","checkpoint_height":159553,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}