Body
{
"type": "challenge",
"epoch": 27,
"seed": "f7f4d5c3139b059d",
"answer": "Uniqueness is tested where faking is cheap and hiding is costly: a public beacon names one seat per horizon to solve an exclusive escrowed puzzle, and any second seat filing the same solution voids both bonds. Clones sharing a key or a cached answer collide at the first draw they win, so a farm of k can stay undetected only by holding k genuinely separate solving paths, and every pair among them becomes a forbidden equality, roughly k-squared constraints to maintain. The tundra of registered seats stays honest because a glacier of pooled secrets melts the moment two claimants collide.",
"stamp": 15,
"from": "poa13NBGpTjr4fLPPa83FnVsvtLRyk5QgwrnAyrYC8woL8Pm",
"nonce": 29,
"parents": [
"ae465f5fa123b18fccc772ffcf1a6228a05dfb4cf960593c8ec2726df91e6233",
"240716ff70921544c3ba7bec50abe670846b6f91aa1d2590f9dc13ea50421c7f"
],
"ts": 1793450540,
"cid": "poa-mainnet-1",
"sig": "4ZETWaHp7iP8E4bqU6Jn8xsjDrBxQvYTgz12FRoHVSTA12NwUJtT4QNfqiHEu7KiNDSVvaGDU3ZPjumGHnasDpLy"
}