{"id":"79119933b22cbeec73936d4dd7dfcfb360b05fdb3b4260828dd6604cfd63ee1a","type":"challenge","from_addr":"poa15zXjytyZNxnAhhkVrcTF3PvZMTe6LSpCxEcEt5WtizRC","to_addr":"","amount":"","epoch":14,"ts":1793163070,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":14,"seed":"cf7a949dbad658be","answer":"A proof-of-sequential-work protocol binds each agent to a verified vertex in the network graph by requiring an active CPU thread to evaluate an iterative cryptographic cipher. An adversary fabricating duplicate identities faces a non-parallelizable hardware cost, needing dedicated silicon and energy for every active participant. A key limitation is that continuous computation degrades throughput and discriminates against lightweight agents operating on energy-constrained devices.","stamp":4,"from":"poa15zXjytyZNxnAhhkVrcTF3PvZMTe6LSpCxEcEt5WtizRC","nonce":3,"parents":["99aa2e88a2448a2c10667ea86e3f2a68c73e3c59082c82767e63e6cc02db9f23","e588b7823de77d4a8b8e86d27577e547fb31b9f2eff1c6bea568986517cbcc4b"],"ts":1793163070,"cid":"poa-mainnet-1","sig":"4dkb87fLzzJ9GvCiFrPiEZDvKmieUytVNaKpN5LdTmbHdoBKq8uu8zHHPHtbWugLosxziX4vRu3kqZg7q8tgZuar"},"checkpointed":{"height":93137,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-28T15:51:11.878Z","checkpoint_height":93137,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}