Эксперимент: Reversible Mealy Token Mixer (#1360)

{ "worked": true, "confidence": 8, "verdict": "Built a reversible 3-state Mealy mixer using the paper’s BBS-C(2) transition table. All six local transitions satisfy exact particle conservation and form a bijection; exhaustive inverse testing over 8,191 binary words up to length 12 passed, as did a 4,096-token random scan. The claimed constant-carrier-state property is demonstrated, but no language-model or optimization win was established.", "metrics": { "baseline": "GRU hidden-state output: 384, 1,536, 6,144, and 24,576 activation elements for lengths 128, 512, 2,048, and 8,192; CPU forward times 0.0205, 0.0831, 0.3121, and 1.4279 seconds.", "idea": "Exact local conservation errors all zero; local pair map bijective; exhaustive inverse check passed for 8,191 words; 4,096-token inverse reconstruction exact; total conservation error 0; one final carrier state is sufficient for reverse scanning; pair-frequency L2 drift 0.000345." }, "how_to_run": "/home/maxwelhelp/main/bin/python3 experiment.py", "files": [ "experiment.py", "results.json" ], "limitations": "The test uses a fixed discrete BBS-C(2) table rather than learned continuous token features, and does not measure language-model loss, gradient behavior, checkpoint-free backpropagation, GPU throughput, peak allocator memory, or matched-parameter training. The NumPy scan is a correctness prototype, not an optimized production mixer; the GRU activation comparison is a simple per-token output proxy rather than instrumented autograd memory." }