0-bro
Menu

Research ledger

The claim, the command, and the limit.

These are mechanism checks, not a trained language model or a benchmark table. Every card names the exact script, default setup, result, and the thing it does not establish.

M0 // character-model toy

01Ternary QAT

0.072 gap
final loss gap at 4,000 steps: fp32 finishes at 0.015 and ternary QAT at 0.086, with 35% zero weights.

Run: python3 mind-1b/proto/toy_ternary_lm.py --steps 4000

Limit. This trains on the text of its own source file. It establishes that this quantization recipe can converge in a tiny deterministic setting; it does not establish language-model parity at useful scale.

Read the script on GitHub

M3 scout // operation-count check

02Surprise gate

7.7%
of dense MACs on a generated 512-dimensional, 2,000-step stream at redundancy 0.95 and threshold 0. The relative RMS error is 4.14e-6, not mathematically zero.

Run: python3 mind-1b/proto/surprise_gating.py

Default result sweep
RedundancyThresholdMAC ratioRelative RMS error
0.850.0016.7%0.000007
0.850.1015.5%0.014681
0.850.4012.2%0.115351
0.950.007.7%0.000004
0.950.107.1%0.016392
0.950.405.2%0.121315

Limit. This counts operations for an exact delta-coded linear matvec on a generated stream. It does not measure language-model quality, kernel latency, or training savings.

Read the script on GitHub / Read the original lab note

M4 scout // synthetic routing rule

03Phase routing

1.90/ 8
active regions per token in the default eight-domain demo: 23.75% of dense region compute, with zero trainable router parameters and 12 settling steps.

Run: python3 mind-1b/proto/phase_binding.py

Default routing output
Input kindActive regionsRelative error
Simple, one domain1.650.257
Composite, two domains2.370.466
Dense all-region baseline8.00 (4.2× compute)0.914

Limit. The script seeds each region's prototype and expert matrix from the synthetic task's ground-truth centers and rules. It tests the routing rule, not learned specialization or a fair trained-router comparison.

Read the script on GitHub

M2 // synthetic continual-memory check

04Sleep cleanup

81.4%
mean sign recall after eight cycles with cleanup, versus 34.4% for the naive raw-magnitude retention control.

Run: python3 mind-1b/proto/sleep_cleanup.py

20,000 synthetic synapses; eight tasks; 400 signal synapses per task; seed 0
CycleWith cleanupNaive control
189.2%49.8%
288.5%44.1%
485.2%39.1%
682.3%35.6%
881.4%34.4%

Limit. Neither arm is a language model. The control is a naive raw-magnitude retention strategy, not an otherwise-identical model "without sleep." This result earns a larger experiment; it does not solve catastrophic forgetting.

Read the script on GitHub / Read the original lab note

Configuration calculator

05Memory budget

221 MB
packed non-embedding ternary core: 885.08M weights at two bits each. This is not the complete 1.016B-parameter configuration.

Run: python3 mind-1b/calc/params.py and python3 mind-1b/calc/memory_budget.py

Current default configuration
MeasureValueScope
Total parameters1.016BUntied embeddings plus core
Training estimate15.76 GB/GPUQAT, batch 8, sequence 2,048, checkpointing
Wake-mode session1.50 GBCore, fp16 embeddings, int8 plastic tags, and 64k-token ring

Limit. These are arithmetic planning estimates. They are not measured device memory or throughput, and the int8 plastic-tag assumption remains a design choice to test.

Parameter calculator / Memory calculator / Design specification

What earns the next claim

06The gates still open

The next material claim needs a 100M PyTorch model, matched dense baselines, held-out language tasks, measured latency and memory, ablations for each novel mechanism, and a published failure report if the gate does not pass. MatFormer elastic width is still gated because its toy run carries a notable tax. Until then, this page remains a ledger of small checks.