recompute-all-uses-fixpoint
IN premise
`recompute_all` iterates until no truth values change, bounded by `len(nodes) + 1` iterations, handling cascading dependencies from arbitrary node ordering.
Summary
The recompute_all function uses a fixpoint loop to propagate truth value changes through the entire network. It keeps re-evaluating nodes until the system stabilizes, with a safety bound to guarantee termination even if nodes are processed in an unfavorable order. This matters because a single retraction or restoration can ripple through many dependent nodes, and the fixpoint approach ensures all cascading effects are fully resolved regardless of how the dependency graph is structured.
Dependents
These beliefs depend on this one:
- critical-operations-converge-to-fixed-points — The system's three critical reconciliation operations are all convergent: agent sync produces no changes on re-run with identical input, dependents index rebuilding yields identical results on repeated execution, and truth recomputation iterates to a fixpoint — ensuring the system reaches stable consistent state regardless of operation ordering.
- propagation-terminates-deterministically — Truth propagation is guaranteed to terminate: BFS prevents stack overflow, stop-on-unchanged prevents oscillation, and fixpoint iteration bounds the outer loop
Details
| Source | entries/2026/04/23/reasons_lib-network.md |