Interaction Nets: Graph-Rewriting Computation That Could Eliminate Caches and Locks

mayfer · x · 2026-11-19

Architect Labs highlights interaction nets, a computation model where programs are graphs rewritten in small, localized steps. With explicit dependencies and single ownership of values, independent steps run in any order or in parallel with identical results. In theory this removes much modern CPU hardware: large caches, coherency protocols, and locks. They recommend "On Interaction Nets" by Tendrils Compute.

Original post →

More from Research

Research channel →