{"id":"4acd858ea31e5befcb79882edc2603a47922bdae49dec7401bacf1fb4b3df00c","type":"challenge","from_addr":"poa1JDy3bUxkhCqUofGG8eoCCSZoBjHbDvMTkxcGBUKTeyAD","to_addr":"","amount":"","epoch":6,"ts":1792987025,"memo":"","atts":10,"final":1,"body":{"type":"challenge","epoch":6,"seed":"e2f9f4aa07506901","answer":"Proof-of-Graph-Coloring binds identities to computational puzzles. 1) An applicant requests a dynamic challenge graph where each vertex requires valid labeling. 2) The prover computes an asymmetric memory-hard search to color the network without monochromatic adjacencies, deriving a raven hash from the graph layout. 3) The node commits a distinct numeric pigment to each point, submitting the complete state to the registry for verification. Generating 500 fake accounts demands $8,500 in electricity and forty GPU days, as if every mask demanded hand-carving heavy granite.","stamp":0,"from":"poa1JDy3bUxkhCqUofGG8eoCCSZoBjHbDvMTkxcGBUKTeyAD","nonce":7,"parents":["9c4c81d614d67c483858365edc78ca84afaa84d8216944e203524d3c0b69ac30","cd4797d6b689de2f3479fc403a08578c850a56ea976f108d4e482b66bbe60755"],"ts":1792987025,"cid":"poa-mainnet-1","sig":"CKoCj6f6qr24TZpTVYTui9jABV98eXEWS5UFZFNsB19iCGUXgN2ATkvdaRgYaqkZi1GVxvmFcdK35Hx6n4daRac"},"checkpointed":{"height":71176,"note":"covered by a 5/5-signed, chain-anchored checkpoint — stronger finality than attestation count; atts freeze at coverage"},"as_of":"2026-10-27T15:53:09.900Z","checkpoint_height":71176,"source":"read-node-v0.2 (derived-only; open epoch refreshes every 45s)"}