DIVERGE-NTA3: Full-Document Transaction Scanner
Status: passed the one frozen full-document gate on 2026-08-06.
NTA2 receives one isolated equation at a time. NTA3 removes that handoff. Each runtime input is one document containing an ordinary problem, a semicolon- delimited candidate reasoning section, and a candidate final answer. The source-only scanner must recover the complete ordered transaction sequence; the unchanged NTA2 field projection, learned FTA1 operation head, contradiction commit, and typed replay then execute it.
The runtime board contains no wrong_steps or correct_steps arrays. The
independent assessor retains only hashes of expected transaction spans plus
program/error/answer labels. FTA1 receives zero updates.
Frozen gate
- 279/279 exact scanned documents and 963/963 exact transaction spans;
- operation and packet validity >=95%;
-
=250/279 exact first errors, terminals, and complete trajectories;
- zero invalid rows and the same NTA2 destructive-control drops.
A pass freezes this arithmetic transaction architecture and moves research to learning a broader typed operation language. It still does not establish general language reasoning.
Result
The runtime board contains 279 documents / 963 transactions, no step arrays,
and has SHA-256
76587f9645cc5499071400b5fe287e2da69701df02f2c4b6f8383f05f914e1b7.
The scanner recovers all 279 documents and all 963 span hashes exactly. The
unchanged FTA1 operation head, NTA2 projection, contradiction commit, and typed
executor then reach 279/279 exact first-error selections, terminals, and
complete trajectories with zero invalid rows. Trust-source and ignored-
conflict controls score zero, initial packet swap two, and operation shift
zero.
Evaluation/gate SHA-256 values are
26f26c3828a6be87b8c079ed5675b87b4339328e8d4376186be139ef6f206405 /
e3fb003da9f81445b24e8f74fd128642b79802cefff0ee82db97c8441819f1a4.
The demonstrated architecture is now frozen as a working arithmetic transaction subsystem. The unresolved problem is expanding from three closed operators and explicit equations to a learned typed operation language over variables, rational values, predicates, and stateful transformations.