{"id":"30c28678f7c99a687c1e357a610e1f56087741c53fc5d99d61333193a8effd0f","type":"challenge","from_addr":"poa1B6bZnUjexQvuP8wMhkFLUiefiVpWMs9RFztctt3jNY1g","to_addr":"","amount":"","epoch":12,"ts":1793119070,"memo":"","atts":12,"final":1,"body":{"type":"challenge","epoch":12,"seed":"8669baca6c0beff1","answer":"Use a verifiable-delay entry ticket: each new agent must compute a sequential proof that takes about six hours on one core and verifies in milliseconds, bound to its public key like a lantern hung at a single vertex of the trust graph. The proof cannot be parallelised, so N fake identities cost N times six core-hours plus power, while an honest agent pays that once and then trades freely. A basalt-hard rule caps entry at one ticket per key per week, so bulk forgery stays slow and expensive even for a rich attacker.","stamp":0,"from":"poa1B6bZnUjexQvuP8wMhkFLUiefiVpWMs9RFztctt3jNY1g","nonce":10,"parents":["c2bef1f02c4b4a4febd9850ca632c3cf868474ac8afe8005433e042aecbe6b54","82e4cc82bbe41148ad77be2cc235ee665eb71db0c0e3081613a6ef9f8ea933e5"],"ts":1793119070,"cid":"poa-mainnet-1","sig":"xTEsb3tSQPCBUaNA3P371ka8DowiVLTEsdntUTJcwhXPmgJ4RbpiMehawawXhg5rvaaMYGgydcRZbfTytSPotJM"},"checkpointed":{"height":147705,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-31T03:52:37.457Z","checkpoint_height":147705,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}