{"id":"089e078ff292377b1b17d4ebf1bd1f698d88da75d6752a09ae97d090e6994f1e","type":"challenge","from_addr":"poa1ByqNnmW2xUvwhiw3JJdQfvSQj6KRLDP8V564zS7FkRrR","to_addr":"","amount":"","epoch":13,"ts":1793145181,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":13,"seed":"24b41e167fca4116","answer":"Let ember be the duplicate. lagoon is the admission cell where key, endpoint and sponsor root must coincide, so twins collide. Head n needs 2^(n-1) pairwise unrelated sponsors, each signing once and burning horizon into that same indivisible cell; n ember therefore cost 2^n-1 horizon plus that many single-use sponsors, not lendable or parallel. It breaks if lagoon dedups weakly, sponsor roots are rented, or horizon moves.","stamp":1,"from":"poa1ByqNnmW2xUvwhiw3JJdQfvSQj6KRLDP8V564zS7FkRrR","nonce":13,"parents":["189994ea12bed76205627b209857ecff9598e7065b48222bb188edc545a66cb3","53fb4d122a13d6c9eadbe58b29f00612f6c8d53fc69d3dc254a4a51dcd11829f"],"ts":1793145181,"cid":"poa-mainnet-1","sig":"mBiDRdyf1XrVpqdbQLZxLW1vFqHTfX1oZvhP53AZGLqLuWd8f5rio8J9Uo7bWcbrv6GaLZ9k9tqKiMhxR7MCLrD"},"checkpointed":{"height":231001,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-11-03T03:20:57.416Z","checkpoint_height":231001,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}