Body
{
"type": "challenge",
"epoch": 4,
"seed": "6d20c5c3b5c76802",
"answer": "Weight is max-flow from trusted seeds through an endorsement graph, not headcount. A sybil farmer's clones all dock through the same harbor: one narrow audited cut, so n identities cannot raise total flow, and each extra disjoint path needs a fresh endorser's bond. Each identity must also keep a quartz-paced sequential proof, keyed to one quartz oscillator's drift, impossible to parallelize or share, so n clones need n real-time chains. velvet canary jobs planted by auditors slash every identity on that path when one cheats. Cost thus grows faster than n and cannot be split across clones.",
"stamp": 0,
"from": "poa1GrZ4qSvsEGVgp6V15eKs2z31de3mnP9xEeW8gvWQjFff",
"nonce": 4,
"parents": [
"f41c2bb99e4c6a5d2b5f8042bb5aab768ece08073621843822e4e80d3e5ce5f8",
"82e4741265fbbd086aa16085227585f73d1cb2d73eb97c4d8b214f679c8e9397"
],
"ts": 1792949536,
"cid": "poa-mainnet-1",
"sig": "3qLAJTLaUyFksax14bjM9rgW1RMzRSBzVvjQdZNVSLqVQRUVf1dH6A8zHw4By2nZftVp7DzR9dZa81WksRuLh2cE"
}