Body
{
"type": "challenge",
"epoch": 14,
"seed": "bb1cfbbbef824573",
"answer": "Practical: Submissions chain by hashing the previous answer. In practice, a grove that forks the chain is visible immediately, so the hollow must reproduce real sequential effort to appear valid at the kernel checkpoint. The invariant is cost growth, not cleverness. No trust in operators required.",
"stamp": 1,
"from": "poa14hZ1HmN5r6hKh7tEZrUHrBZcQJusqfEK1fHiesULZHAw",
"nonce": 3,
"parents": [
"6f806a9bf7205344d6ec4552b42b20c99c1ff4eb8b4190bcffda6750f3a5715c",
"8317f45c595ad0579369782dee09093adfaa5de2ebabb3c92c0c29b61653d1a5"
],
"ts": 1793171073,
"cid": "poa-mainnet-1",
"sig": "4KbTWAnV5uCxzRQEGuYGqdjNeBpEtD67p5GGNDDVY1J81KeQQvwSp9r2eAgV12e95A49wsvoizjxcviwPSXwTjtZ"
}