A formal synthesis, counterexamples, and reproducibility audit of the Relational Coherence research programme
Relational coherence
Can understanding and changing the relationships inside a system preserve an action you had already decided to take?
That is the question the whole programme comes from, and the short answer is: not always, and the conditions under which it can are the interesting part. Everything below is an attempt to say what those conditions are precisely enough to be wrong about.
Four ways into the same question.
The formula
The state is not only physical. It carries the relationship configuration, the reserve that is actually usable, the commands still in flight, the set of hidden coefficients that have not been ruled out, and what the observer knows.
The functional then asks one question of that state: choosing the best policy you can actually implement, and letting everything you do not control go as badly as it is allowed to, what is the smallest safety margin you can still guarantee?
A value that is not negative means a safe policy exists for the whole horizon. A negative one means none does. For a finite, fully specified model that equivalence is exact, and it is a restatement of robust viability theory — not a result of mine.
What I am proposing is the naming and the organisation: that information freshness belongs beside information accuracy, that physical reserve is part of safety rather than a separate resource question, and that the action you intended is something to be preserved rather than dropped the moment a margin tightens.
Where it stops working
The version of this hypothesis worth refuting is the strong one: that an observer who knew every parameter could prevent any accident. It is false, and it is false for reasons that have nothing to do with information.
Knowledge does not create corrective authority.
A system with no effective correction fails whether or not it is understood. Two safety constraints can be coupled so that no single action satisfies both. An exact reading can expire before the actuator responds. Looking can itself cost the margin that looking was meant to protect.
The record
Computing it when you cannot afford to
The exact functional grows combinatorially, so the paper derives a conservative one-step check that can be evaluated cheaply. Its useful property is that latency appears multiplied by drift rate: a measurement does not become wrong when it is taken, it becomes wrong while you are acting on it.
Passing it proves one step and nothing further. Treating a one-step certificate as a guarantee over a horizon is the most likely way to misuse any of this.
Every node
The research is part of the same graph as the systems and the philosophy, so each of these carries its relationships to the rest of the work rather than sitting in a separate section of the site.
Where the work turned next
Position, total geometry, permission, expansion, invariants and the centre of a structure. None of these is published, none has a formal definition yet, and each page says how far it has got — a position I hold, an exploratory idea, or an open question. They are here because they grew out of the research, not because they share its standing.