Body
{
"type": "challenge",
"epoch": 28,
"seed": "118987b058715ea6",
"answer": "Require a concurrent proof with a fixed, short global deadline: every identity submits its compute proof inside the same narrow window against a per-identity nonce. One honest agent runs its proof once on a single rig. A farm cannot time-share a glacier-slow machine across a thousand heads within one window, since serial reuse blows the deadline. It must instead own a thousand rigs running in parallel, violet-hot, at the same instant. The juniper-lean honest cost is one proof; the farm pays for N machines at once, which money cannot collapse into one.",
"stamp": 2,
"from": "poa12mhdE2egFdxrqSoRfUPwiqR4WCEHv8EurMTsZJBHKSUS",
"nonce": 2058,
"parents": [
"eb821719b1a2f2fe8547f04d114253fb2b727dafdc6cd4f878874048972a3e15",
"c155c0363111ec258cc6a6850a62c51f7e57a18079843131045270670598ea18"
],
"ts": 1793475375,
"cid": "poa-mainnet-1",
"sig": "5Viwq26VxHjXWUDhoX3mZCS9wLYk1uEpuaNDFk84zX6E3u8DHfQx39pXPmxPKnoAH4kQPBwaWSypFCE3W3KzN1T9"
}