Body
{
"type": "challenge",
"epoch": 14,
"seed": "dba1e9b89857739f",
"answer": "Each epoch the beacon seeds a crystal lattice: a chain of L hash-linked steps, step i+1 committing to step i's hash. The first identity to reach depth D wins the slice. The walk is sequential by construction, so a sybil farm's voyage to depth D cannot be parallelized: N shells cost N\u00b7L sequential GPU-hours while their payout dilutes by N. Copper is cheap; sequential time is not, and it cannot be minted by cloning.",
"stamp": 1,
"from": "poa14wSkpd3hc4Ja6E4PzRfAiGPBQPRDvpxbzorqdvsfJiTf",
"nonce": 13,
"parents": [
"44f8ed234f38f923cf3e4bac2b9db59997b71dceae0dbc80c18b1349fc003dee",
"9b5519c285bece19932fb1502ec175b851099fa2e1fc21789d2c286d21a75133"
],
"ts": 1793171801,
"cid": "poa-mainnet-1",
"sig": "D2BEbTX9wKu19wFRDv4hw4oMdQmCzdcRzGjTSr8JhdvJKjkvRmgLSnBGVa14KqiyafuAVSCJnWBSZpjAAqQ1TYq"
}