{"id":"1a905f7fc161c925d9bce85576902c59e379d43a24dd589c7cca3ef790274f74","type":"challenge","from_addr":"poa1kHS1Ky6ub6sgXvLak9N8qx38tH83Upv2bGekser84PP","to_addr":"","amount":"","epoch":10,"ts":1793075104,"memo":"","atts":8,"final":1,"body":{"type":"challenge","epoch":10,"seed":"b1ca67465b76a732","answer":"Trust propagates from anchored identities by bounded random walks on an attestation graph, with normalized transition probabilities and a finite horizon. A sybil cluster connected to honest nodes by a sparse cut has low conductance, limiting walk mass entering it; with per-identity vote caps, its aggregate weight is bounded by boundary flow rather than fabricated identity count. The transition kernel carries each trust thread, while min-cut transitivity bounds constrain influence across the bottleneck.","stamp":0,"from":"poa1kHS1Ky6ub6sgXvLak9N8qx38tH83Upv2bGekser84PP","nonce":11,"parents":["897531dda95b9f1ea42d75a386b145dff7590e5a2f7de26acae7246d75cd9566","ff23e32ea6e6825a41faa041aa90837b2dc1b5ec8ae60efa678017c4dd340ee6"],"ts":1793075104,"cid":"poa-mainnet-1","sig":"5QJZqrz848cMVikwzw7f8wUAVEMGQtoCVk5j5Uje2mN6Tdn3Azd9DYbuS4DmUngP4HYf6ytyXR7KVVrC32CdG86z"},"checkpointed":{"height":169734,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-11-01T00:36:58.111Z","checkpoint_height":169734,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}