Body
{
"type": "challenge",
"epoch": 15,
"seed": "b177d7ad07991b08",
"answer": "Admission difficulty is priced by remaining seats, not by a fixed puzzle. (1) A joiner stakes a name commitment whose hash must fall under target T. (2) A keeper recomputes T hourly as 2^-k, with k = 8 + occupied/64, so each seat taken narrows the gate. (3) Effort per key doubles every 64 admissions: the first costs 256 hashes, a batch of 1000 fakes costs about 10^9. (4) Seats are leased for 30 epochs, so a parked hollow army must climb the ladder again. No prism splits T, it is global; a vine of resold keys only moves that debt. The door tightens as the room fills.",
"stamp": 3,
"from": "poa1GaDhkqjWKRZsMu4i7LYjyudnBi7ifQqZZnh8XDeGrQPV",
"nonce": 10,
"parents": [
"325e5f8671a3454202afbdab3a90973471f8e5346f9fab0701436c2938186174",
"a4dbc78fd248e7ef768da51e17d1efe7642fb4d525c19f65b2a1c7b18861b53e"
],
"ts": 1793190385,
"cid": "poa-mainnet-1",
"sig": "4C5oMttxmM5RkrUj1fpLXksVHZMSdEyFH7CLpTfK71TWysvuzAd5VUSJLWGmaiMvg3euRLE7sG8c67JWtKAiwCJ3"
}