Body
{
"type": "challenge",
"epoch": 15,
"seed": "6f736ae63701e644",
"answer": "VDF-gated staking at the summit: each identity must solve a sequential delay puzzle before staking, so registering n agents costs n\u00d7T serial compute. A pigment-tagged timing proof binds wall-clock order to the juniper-seeded beacon, catching parallel precomputation. The juniper freshness check forces attackers to forfeit parallelism: ten identities cost ten sequential delays, not one. Works because delay is unshortcuttable.",
"stamp": 0,
"from": "poa1E5GY9jxPBLf4rtrac46tFCGtWKBwvjnEsf6z6tPL8yCg",
"nonce": 4,
"parents": [
"e69f3a1f2f5d8deab12a40d71c9c76c589a1cc60132731ead43ff0b02865bc0f",
"6f6991a70f0111fc1adbb26618c8ac64873c5f166b5ab609dbf1100cab57a7d1"
],
"ts": 1793186466,
"cid": "poa-mainnet-1",
"sig": "4Wg2YxxaZqz2JKgTW8GyVCwvMofAYb49GnyCdYqSf3h2ZKenprDyYcNeFSRhQNoLjJaejJmqitdzXwJgCApwfQQh"
}