Training memory that does not grow with sequence length
A sixteen-fold increase in sequence length leaves the eligibility-trace method’s training memory unchanged and multiplies backpropagation-through-time’s by sixteen. Measured deterministically and confirmed against real peak allocations.
BoundaryThis is a memory claim only. It is not a claim that the method matches backpropagation through time on accuracy, wall-clock, or any downstream task. No accuracy comparison is made, and none should be inferred.
No non-confoundable information integration at this scale
The integration and global-workspace probes separate a genuinely integrated control from degenerate ones, and they score this substrate as showing no non-confoundable integration. Its measure is real but not distinguishable from a noise control. That result is reported as it stands.
BoundaryAn earlier framing of this work reported a weak positive signal. That reading did not survive a gate requiring substrate-derived evidence, and it is retracted in the repository’s own claims document.
The instruments report negatively on their own substrate
The probes were built by the same people who built the thing being measured, which is exactly the situation where a result gets quietly shaded. Publishing the null, and the retraction of the earlier positive reading, is the only way that instrument means anything.
BoundaryA null at this scale is a statement about this substrate at this size, not a general result about the architecture class.
You can check both on a laptop
Pure Python and NumPy, Apache-2.0, no GPU, no service, no network calls, nothing phones home. The test suite runs in a couple of minutes, so both results are reproducible by anyone who wants to disagree with them.
BoundaryThe memory figures come from a machine with no CUDA device, so peak process memory is the honest stand-in for peak device memory. That substitution is stated in the code that makes the measurement.