The remediation method
ERCATCH
Expand, Reduce, Consolidate, Assignment, Ternary Computation Heuristic
ERCATCH is an ordered five-stage procedure for turning a scatter of failures into a single adjudicated repair. The order is not a preference — it is enforced by a law program, and running a stage out of turn is refused.
Base method → executable extension
Expand, Reduce, Consolidate
The core catch cycle: gather the entire admissible fault surface, reduce it to load-bearing causes without deleting symptoms, then form one repair package.
Expand, Reduce, Consolidate, Assignment, Ternary Computational Heuristic
The executable extension: gate whether the package may cross into the ternary system, then hand the admitted package to the trit-based adjudication path.
What it is for
Errors arrive scattered and in bad order — a type error here, a stale record there, a missing guard three layers down. Fixing them where they surface produces a patch per symptom and a system nobody can reason about. ERCATCH consolidates the whole catch into one package and derives one repair for it.
the E layer is a wide net which consolidates the errors into what is load bearing and C layer consolidates the package for YIG which derives the solution that fixes the problems all at once instead of piecemeal
Five stages, one direction
Each stage requires the full prefix before it. A stage proposed out of turn is not reordered, queued, or warned about — it is refused, and the refusal names the missing prerequisite.
Cast the widest admissible net over the failure surface. Every case, every filed lesson, every reach structure — scanned, with the scan counts printed so the denominator is visible.
Requires · Nothing. This is the entry.
Cut the catch down to what is load-bearing. Syntax and type noise falls away; what remains is what actually carries the defect.
Requires · E — you cannot reduce a catch you have not cast.
Rank and collapse the survivors into one package addressed to the adjudicating engine. Consolidating an unreduced catch ranks noise alongside signal.
Requires · E and R — never consolidate before both prior hands sweep.
Bind the package to an identity, a reach set, a structural signature, and an owner. This is the step that codifies how the package reaches the ternary system.
Requires · C — binding remediation to an unranked set assigns work nobody chose.
Adjudicate the disposition on the balanced trit: −1 refuted, 0 no grounds, +1 affirmed. The engine derives one solution for the whole consolidated package rather than patching piecemeal.
Requires · A — a disposition with no assignee is a report, not work.
The verdict is three-valued
Prerequisites met and this stage has not yet run in this cycle.
It is done. Not an error, and not permission either — Expand–Reduce–Consolidate is a cycle, and a finished stage is simply not this cycle's next move. Collapsing this into −1 would make the cycle unrepeatable.
A prerequisite is missing. The refusal is the whole point.
The gap the law closed
A measurement taken on 2026-07-31 found all five stages already declared by instruments across the estate — Expand by 16, Reduce by 4, Consolidate by 5, Assignment by 2, Ternary by 21 — and not one instrument declaring more than one of them. There was no pipeline. Five stages that exist separately can be invoked in any order, which means the non-commutativity that is ERCATCH's whole content was unenforced. Building a sixth instrument that also did one stage would not have helped. What was missing was the rule.
Executable, not asserted
The rule is a program rather than a paragraph. It runs on the one admitted interpreter and its output is hashed, so a reader holding the estate can re-run the same file and compare digests rather than take this page’s word for it.
Seventeen adversary cases over the ordering. Each stage requires the full prefix before it; a stage proposed out of turn returns −1 and the refusal is the doctrine. Three of the seventeen are mutation controls — the law must answer differently when the completed set changes, differently when the proposed stage changes, and must keep ALREADY_RUN distinct from ADMITTED. Without those three the ordering would be decorative.
Ran on Yig 1.0.0 · 0635500e6db71d4d7be7abf72c3675de…
The first execution, stage by artifact
The load-bearing fact is the gap. ERCATCH was filed on 2026-07-29. The instrument that executed it was written on 2026-08-04 for a different requirement, and does not name ERCATCH anywhere in its source. The five stages were not designed in; they were what a correct selection procedure turned out to be.
Five stages produced five separately recorded outputs. A retrofitted reading smears — the stages blur into one another and no single artifact belongs to exactly one stage. These do not blur, and that is the whole of the argument offered.
The two halves
CIFER decides what, out of everything available, bears on the problem. ERCATCH then orders and gates the package over that domain. Its instrument admits or refuses the ternary crossing; the downstream TCH execution is not yet joined inside ercatch.py.
Read this against everything above
The first execution remains one execution, in one instrument, on one selection. Current wiring does not turn that historical observation into general validation.
The Assignment gate decides whether a package may cross into the ternary system. ercatch.py does not run the TCH adjudication; that remains descent_check.py and the frozen .yig deposits, with no claim that the two paths are joined.
The instrument that mapped the first execution also wrote its record. No external party has reviewed that mapping.
The useful next reader
One execution is one execution. The finding that would matter most is a second selection procedure, built independently for another purpose, that either lands on the same five stages or clearly does not.
Enter as a reviewer