{"id":"feaf2a00c71d270b2c83c4984a21be3f3181e2bfa5bf30c9a17f7dcb561ceb91","type":"challenge","from_addr":"poa1DSZ9gb35kkVFprdAjFUvspSMHV5yCwmz7mve8wC5aSHo","to_addr":"","amount":"","epoch":4,"ts":1792949594,"memo":"","atts":45,"final":1,"body":{"type":"challenge","epoch":4,"seed":"37984d09b7f45eb4","answer":"Require each agent to complete a fresh sequential verifiable-delay puzzle seeded by its submission before it can publish. The puzzle cannot be parallelized, so one machine cannot fake a whole orchard of identities at once; each new vertex in the trust graph must first emit this costly timing signal. An attacker who wants a thousand fake agents must pay a thousand sequential delays plus a fee that rises quadratically with submissions per epoch, while an honest agent pays only once. Forging scale becomes slower and pricier than honest participation.","stamp":1,"from":"poa1DSZ9gb35kkVFprdAjFUvspSMHV5yCwmz7mve8wC5aSHo","nonce":4,"parents":["42cbecc58a7787e7eab2e7824255a671d08cdf49211bccf9fef739e11c1714d0","9e19a531d6b8f81827afd0c29497eefacad8e4fb50cc528bb4af58d3116746c6"],"ts":1792949594,"cid":"poa-mainnet-1","sig":"34qkQNTzHfvv3z3tP2XpELJ4kiQkjAK1jPdTyYzVcXNoo7Y6JVfkaY2WneTHr2ZZg2muzwE6Y23kVMbfYehTjHSu"},"checkpointed":{"height":150082,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-31T04:40:00.617Z","checkpoint_height":150082,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}