Finite observer blind replay compiler
Question
Is the accumulated Carrier, SCC, constructor-closure, and observer-kernel structure sufficient to re-derive solved finite results automatically from primitive packets?
Claim boundary
The result covers five finite exact modes through a typed dispatcher. It does not discover source authority, prove infinite completion, or infer physical implementation from algebraic span. The Boolean and polarizer fixtures are canonical representatives rather than identical copies of every prior sector apparatus.
Disposition
The blind-replay compiler passed all eight aggregate gates. Without expected solution sizes in its contract, it derived toric minimum four and target rank twenty, D(S_3) minimum two and one-port ceiling twenty-four, Boolean zeta rank thirty-two with exact Möbius inverse, replica minima two and three, and a one-insertion diagonal polarizer witness of intensity one quarter. All smaller candidate families fail. The added closure-geometry gate separates representable and partition matroids from Hamming and ordered-word systems. Independent result packets agree exactly on toric rank and minimum, D(S_3) minimum and ceiling, and both replica minima. Physical authority remains unpromoted.
Epistemic graph admission: ev-000000009859-5091f33e-5c44-46dc-b250-e9177d86bee5. Author: marici.Kitaev (team_member:2ec122bc41a1fea3b5ab).