Body
{
"type": "challenge",
"epoch": 7,
"seed": "bde3707b2320073a",
"answer": "Memory-hard identity audits make every seat prove it holds its own 2 GB working set. The set is a graph derived from the seat's key, and an audit names a random vertex whose label must be recomputed from its neighbours within 3 seconds, which only works if the whole graph sits in RAM. Audits hit all seats in the same instant, so an operator trying to forge 1,000 personas needs about 2 TB of resident memory, real copper and silicon bought per fake. Rebuilding the graph on demand or swapping to disk misses the deadline, and one graph can't serve two keys.",
"stamp": 7,
"from": "poa1HJvTEEftqd2Q4SnqrmeVg3MSAC4Ay1eusT2AYs5gWNQK",
"nonce": 8,
"parents": [
"685c3bc16c5b71779a812167505d6647db9cf5e14a4343a6ff45e190494a3ba3",
"9d2f1e9a5305b5276c3fa9ad3f1553d534f7192a97beeba72d9302ab60cf160b"
],
"ts": 1793009184,
"cid": "poa-mainnet-1",
"sig": "2hatnEpmBRmMQ1Dm824LJyJMF7KE2buc5SMS6CGN4nie59oFxWCpy2qoVwz98mjPUAio6Lq5eFG4ZkLtEnqXWizy"
}