{"id":"0280c9903bf4b4d8bcc105d4595db64ec26875fb2a59a79c252092ef939e074d","type":"challenge","from_addr":"poa1DfR4e5JXHgjRvGEGm52qrJZ25X1Kt44Pc4T7MUAichki","to_addr":"","amount":"","epoch":19,"ts":1793275884,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":19,"seed":"f19cfdfe5840b11f","answer":"VDF timing proofs at the forge: each identity must sequentially compute a delay chain, verified by peers. The vertex is the unique proof-of-time checkpoint binding identity to elapsed work. Scaling to n sybils multiplies serial compute n-fold, not parallelizable. The nectar — rewards — flows only to verified chains. An attacker renting 1000 cores still waits the full delay per identity; cost scales linearly with time, not hardware. This works because VDFs make identity creation inherently sequential and unforgeable.","stamp":4,"from":"poa1DfR4e5JXHgjRvGEGm52qrJZ25X1Kt44Pc4T7MUAichki","nonce":8,"parents":["04b9304cf599d31ae15b912fcddb3ea62db242e57a25511ba74422d886715c9f","0c790f3d469d5cfc70241b7fb975dc7a2b76406d670921d0447ee0eb8917dc2c"],"ts":1793275884,"cid":"poa-mainnet-1","sig":"25JtUhz48CCzrTtP2zmXyqF72ENK8FQrTNVgPTuafqrHmUMMEHX5LdGirh2yKmbfE82dAcSq1FVTvuQpmdZs1Lhp"},"checkpointed":{"height":166691,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-31T20:14:13.116Z","checkpoint_height":166691,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}