Initial NanoMath-R release

.gitattributes

@@ -1,35 +1,2 @@
-*.7z filter=lfs diff=lfs merge=lfs -text
-*.arrow filter=lfs diff=lfs merge=lfs -text
-*.bin filter=lfs diff=lfs merge=lfs -text
-*.bz2 filter=lfs diff=lfs merge=lfs -text
-*.ckpt filter=lfs diff=lfs merge=lfs -text
-*.ftz filter=lfs diff=lfs merge=lfs -text
-*.gz filter=lfs diff=lfs merge=lfs -text
-*.h5 filter=lfs diff=lfs merge=lfs -text
-*.joblib filter=lfs diff=lfs merge=lfs -text
-*.lfs.* filter=lfs diff=lfs merge=lfs -text
-*.mlmodel filter=lfs diff=lfs merge=lfs -text
-*.model filter=lfs diff=lfs merge=lfs -text
-*.msgpack filter=lfs diff=lfs merge=lfs -text
-*.npy filter=lfs diff=lfs merge=lfs -text
-*.npz filter=lfs diff=lfs merge=lfs -text
-*.onnx filter=lfs diff=lfs merge=lfs -text
-*.ot filter=lfs diff=lfs merge=lfs -text
-*.parquet filter=lfs diff=lfs merge=lfs -text
-*.pb filter=lfs diff=lfs merge=lfs -text
-*.pickle filter=lfs diff=lfs merge=lfs -text
-*.pkl filter=lfs diff=lfs merge=lfs -text
-*.pt filter=lfs diff=lfs merge=lfs -text
 *.pth filter=lfs diff=lfs merge=lfs -text
-*.rar filter=lfs diff=lfs merge=lfs -text
-*.safetensors filter=lfs diff=lfs merge=lfs -text
-saved_model/**/* filter=lfs diff=lfs merge=lfs -text
-*.tar.* filter=lfs diff=lfs merge=lfs -text
-*.tar filter=lfs diff=lfs merge=lfs -text
-*.tflite filter=lfs diff=lfs merge=lfs -text
-*.tgz filter=lfs diff=lfs merge=lfs -text
-*.wasm filter=lfs diff=lfs merge=lfs -text
-*.xz filter=lfs diff=lfs merge=lfs -text
-*.zip filter=lfs diff=lfs merge=lfs -text
-*.zst filter=lfs diff=lfs merge=lfs -text
-*tfevents* filter=lfs diff=lfs merge=lfs -text
+*.model filter=lfs diff=lfs merge=lfs -text

LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

README.md

@@ -0,0 +1,161 @@
+---
+license: apache-2.0
+language:
+- en
+library_name: pytorch
+pipeline_tag: text-generation
+tags:
+- mathematics
+- recurrent-transformer
+- custom-code
+- sentencepiece
+datasets:
+- openai/gsm8k
+- AI-MO/NuminaMath-1.5
+- EleutherAI/asdiv
+---
+
+# NanoMath-R
+
+NanoMath-R is a math model with 103.83 million parameters, written from scratch
+in PyTorch. It has 16 stored Transformer decoder blocks and applies the same stack
+twice, giving 32 block applications per token without storing a second stack of
+weights.
+
+The release is intended for research on small models and direct integer arithmetic. It
+is not a general assistant and it is not a dependable solver for word problems,
+fractions, algebra, proofs, or calculations where an error could cause harm.
+
+## Model details
+
+| Setting | Value |
+|---|---:|
+| Stored parameters | 103,834,368 |
+| Physical decoder blocks | 16 |
+| Recurrent passes | 2 |
+| Unrolled depth | 32 |
+| Width | 768 |
+| Query heads | 12 |
+| Key and value heads | 4 |
+| Context length | 1,024 tokens |
+| Vocabulary | 4,096 SentencePiece tokens |
+| Position encoding | RoPE |
+| Normalization | RMSNorm |
+| MLP | SwiGLU |
+
+The model uses grouped query attention and tied input and output embeddings.
+Its projections have no bias, and its residual projections were initialized to
+zero at the start of training.
+
+## Files
+
+- `model_weights.pth` contains the weights, model configuration, and training
+  metadata.
+- `token.model` is the matching SentencePiece tokenizer.
+- `model_config.json` and `training_summary.json` expose the main checkpoint
+  metadata without loading PyTorch.
+- `benchmark_results.json` records the release checks.
+- `checksums.sha256` covers every published model file.
+- `LICENSE` contains the Apache License 2.0 terms.
+
+This checkpoint is incompatible with the NanoMath v1.0, v1.1, V2, and V3
+tokenizers.
+
+## Run it
+
+The checkpoint uses the custom classes in the
+[NanoMath-R source repository](https://github.com/agmada-asa/NanoMath-R). It
+does not load through `AutoModelForCausalLM` or the standard Transformers text
+generation pipeline.
+
+```bash
+git clone https://github.com/agmada-asa/NanoMath-R.git
+cd NanoMath-R
+python3 -m venv .venv
+source .venv/bin/activate
+pip install -r requirements.txt
+hf download agmadaasa/NanoMath-R model_weights.pth token.model --local-dir build
+python3 scripts/chat.py "What is 84 / 7?"
+```
+
+The prompt format is:
+
+```text
+<|user|> What is 84 / 7? <|end|>
+<|assistant|>
+```
+
+Greedy decoding is the default. The model normally emits a reasoning span,
+then `<|answer|>`, a numeric answer, and `<|end|>`.
+
+## Evaluation
+
+Fresh release checks used greedy decoding, two recurrent passes, a KV cache,
+FP16 on Apple MPS, and at most 384 new tokens.
+
+| Evaluation | Examples | Macro exact match | Micro exact match | Malformed |
+|---|---:|---:|---:|---:|
+| Synthetic math reserved for evaluation | 50 | 63.27% | 66.00% | 2.00% |
+| SVAMP | 40 | 22.50% | 22.50% | 0.00% |
+| NanoMath v1.1 continuity prompts | 6 | 50.00% | 50.00% | 0.00% |
+
+The clearest strength is direct integer arithmetic. On the synthetic sample it
+scored 8/8 addition, 8/8 subtraction, 7/7 multiplication, and 7/7 exact
+division. The same sample scored 2/7 linear equations, 1/7 word problems, and
+0/6 fraction questions. These samples are small. They describe observed
+behavior, not a guarantee.
+
+## Training
+
+The packed training stream contains 233,896,960 token positions and 1,066,609
+accepted documents after length filtering. Its source counts are:
+
+| Source | Documents |
+|---|---:|
+| Verified structural arithmetic | 750,000 |
+| NuminaMath | 190,209 |
+| Generated language curriculum | 117,487 |
+| GSM8K | 7,404 |
+| ASDiv | 1,509 |
+
+The run completed 6,000 optimizer steps and processed 393,216,000 token
+positions, about 1.68 passes through the packed corpus. It used two NVIDIA T4
+GPUs, FP16, sequences of 1,024 tokens, attention isolated between documents,
+loss weights based on message role, and activation checkpointing. Training
+took 41,623.7 wall seconds, or 23.12 hours of accelerator use. The checkpoint
+records validation loss 0.129966.
+
+Prompt tokens had weight 0, reasoning tokens weight 1, and answer tokens weight
+3. Every packed document reset its positions and could not attend to another
+document in the same block.
+
+## Limits and intended use
+
+Good uses include studying recurrent depth, reproducing the reported
+experiments on small models, and testing direct arithmetic prompts with independent
+verification.
+
+NanoMath-R is not reliable for financial, medical, engineering, or other
+calculations where an error could cause harm. It can produce fluent reasoning
+with the wrong final number. Training primarily used English, the context
+window is 1,024 tokens, and the release represents one training seed. The model
+has not received a broad safety or bias evaluation. It is also outside its
+intended scope for coding, factual retrieval, unrestricted chat,
+formal proof, and advanced mathematics.
+
+The source datasets retain their own licenses and terms. Users should review
+those terms before redistributing derived artifacts.
+
+## Integrity
+
+Checkpoint SHA-256:
+
+```text
+6d251ab0c7595023006f7975b05436676311c18f17c8df608dc44a3e24f937b2
+```
+
+Tokenizer SHA-256:
+
+```text
+195e6efabd0a9dc238f04c83807d4e2cb79bd0270866773ad0b71a44c3794ba1
+```

benchmark_results.json

@@ -0,0 +1,34 @@
+{
+  "checkpoint_sha256": "6d251ab0c7595023006f7975b05436676311c18f17c8df608dc44a3e24f937b2",
+  "configuration": {
+    "decoding": "greedy",
+    "device": "mps",
+    "dtype": "float16",
+    "max_new_tokens": 384,
+    "recurrent_steps": 2,
+    "use_kv_cache": true
+  },
+  "results": {
+    "synthetic_heldout_50": {
+      "examples": 50,
+      "macro_exact_match": 0.6326530612244898,
+      "micro_exact_match": 0.66,
+      "malformed_rate": 0.02,
+      "sample_seed": 2026
+    },
+    "svamp_40": {
+      "examples": 40,
+      "macro_exact_match": 0.225,
+      "micro_exact_match": 0.225,
+      "malformed_rate": 0.0,
+      "sample_seed": 2026
+    },
+    "v1_1_spotcheck": {
+      "examples": 6,
+      "macro_exact_match": 0.5,
+      "micro_exact_match": 0.5,
+      "malformed_rate": 0.0
+    }
+  },
+  "tokenizer_sha256": "195e6efabd0a9dc238f04c83807d4e2cb79bd0270866773ad0b71a44c3794ba1"
+}

checksums.sha256

@@ -0,0 +1,8 @@
+3ef871b57485277e59624459be46c7bcb79db58b191fa4433380e7949bf823f8  .gitattributes
+c71d239df91726fc519c6eb72d318ec65820627232b2f796219e87dcf35d0ab4  LICENSE
+9ae2b40a55d8363687245aa5d21f1a2610cac1f27a80de16d55d2c2a2aebb93d  README.md
+81f60c9c756c7b54f1bff6fc536be5985f2e37f62ed11000cb3b3df1b74f8c1d  benchmark_results.json
+a9e3ba137dcdbc420b60ea7c04ddea58de5370818ce7861c2a48bf7c6854c58f  model_config.json
+6d251ab0c7595023006f7975b05436676311c18f17c8df608dc44a3e24f937b2  model_weights.pth
+195e6efabd0a9dc238f04c83807d4e2cb79bd0270866773ad0b71a44c3794ba1  token.model
+98d995aac8ef25850c80ad3051525d2403871b009d177040b68c95080c786101  training_summary.json

model_config.json

@@ -0,0 +1,19 @@
+{
+  "architecture": "recurrent_transformer",
+  "bias": false,
+  "block_size": 1024,
+  "dropout": 0.0,
+  "mlp_type": "swiglu",
+  "n_embd": 768,
+  "n_head": 12,
+  "n_kv_head": 4,
+  "n_layer": 16,
+  "norm_type": "rmsnorm",
+  "physical_layers": 16,
+  "position_encoding": "rope",
+  "recurrent_steps": 2,
+  "tie_embeddings": true,
+  "unrolled_depth": 32,
+  "vocab_size": 4096,
+  "zero_init_residual": true
+}

model_weights.pth

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:6d251ab0c7595023006f7975b05436676311c18f17c8df608dc44a3e24f937b2
+size 427953328

token.model

@@ -0,0 +1,3 @@
+version https://git-lfs.github.com/spec/v1
+oid sha256:195e6efabd0a9dc238f04c83807d4e2cb79bd0270866773ad0b71a44c3794ba1
+size 303491

training_summary.json

@@ -0,0 +1,14 @@
+{
+  "accelerator_hours": 23.124297935119447,
+  "block_applications_processed": 12582912000,
+  "estimated_training_flops": 601157982486528000,
+  "optimizer_steps_completed": 6000,
+  "peak_accelerator_memory_bytes": 2956411904,
+  "step": 5999,
+  "stored_parameters": 103834368,
+  "tokens_processed": 393216000,
+  "training_wall_seconds": 41623.736283215,
+  "validation_loss": 0.12996602058410645,
+  "validation_loss_step": 5750,
+  "world_size": 2
+}