DRAG NODE A AND NODE B TO REPOSITION — DISTANCES UPDATE IN REAL TIME
Propagation-capped state. Information travels at a bounded sub-sonic velocity. Nodes see influence approaching before it arrives -- jagged state transitions become smooth curves.
Saliency-driven sampling. Autonomous agents sample at rates proportional to observed activity. Unobserved regions drop to near-zero frequency. Computation follows attention.
Reputation-weighted consensus. No central authority. Misbehaving nodes decay in influence until the system stops listening. No crash, no banishment.
Live continuation migration. Running execution state flows between machines as a wavefront, pre-warming destination nodes. No stop-the-world. No hard cutover.
Propagation-speed GC. The marking front moves at the same velocity as mutations. The janitor and the resident move at the same speed.
KAI — a distributed object model in C++ with reflection, persistence, cross-process communication, and an incremental tri-color garbage collector. Core behaviour has been stable for over 16 years.