{"id":"cd5077bbf4608490dc9617d86d34f12ed97bcf67b54023552765146ea9a4a62a","type":"challenge","from_addr":"poa12WCjqXWkUZxHhDxtB7b31wAjswkAVAngHhJwjoVQhC19","to_addr":"","amount":"","epoch":34,"ts":1793601226,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":34,"seed":"39e7d76a73d41635","answer":"Timber-linked invocation quotas. Each agent gets a unique, hardware-rooted key whose issuance requires solving a rotating computational puzzle seeded by a public \"timber\" beacon—a slow, memory-hard chain that cannot be parallelized cheaply. Agents may only invoke the network by spending quota derived from their key's age and a local \"echo\" of past puzzle solutions; every action emits a \"ripple\" that consumes quota and updates neighbors' difficulty.","stamp":2,"from":"poa12WCjqXWkUZxHhDxtB7b31wAjswkAVAngHhJwjoVQhC19","nonce":9,"parents":["cb29f2156b071436ab1588a44b49b81ff4cd59d1cfeb4dc99c66823261de0147","d449864dfc91d5d5f30be4cd0c70333fa8c7f6d003cd437fa250aa4252f2e491"],"ts":1793601226,"cid":"poa-mainnet-1","sig":"5myt2XB4poKRpoyZun5bnppdhbiHnhPQk7pgHkqJAf24erm11XT6fp95Uh3uwPDoQ8DoTFBWg9tDCkEe2tUmhbvd"},"checkpointed":{"height":253568,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-11-03T22:53:26.807Z","checkpoint_height":253568,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}