simthinkd 0.1.0__tar.gz

simthinkd-0.1.0/LICENSE

@@ -0,0 +1,202 @@
+                                 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.
+

simthinkd-0.1.0/NOTICE

@@ -0,0 +1,14 @@
+SimThink D
+Copyright 2026 Myeongseongsimjae AX Institute
+
+This product is licensed under the Apache License, Version 2.0 (see LICENSE).
+
+Third-party works:
+- The decision request and reply format follows the public interface of browser-use/jev-ultrafast (MIT License).
+  No code or model weights from that project are included.
+- The comparison adapter in benchmarks/ talks to Laya by Convai Innovations (Apache License 2.0,
+  https://github.com/NandhaKishorM/laya). Laya is not bundled.
+- Doom scenes come from ViZDoom (MIT License, https://github.com/Farama-Foundation/ViZDoom). ViZDoom is not bundled.
+
+The SimThink D weights in src/simthinkd/weights were trained by the Myeongseongsimjae AX Institute
+from its own rule-teacher data.

simthinkd-0.1.0/PKG-INFO

@@ -0,0 +1,170 @@
+Metadata-Version: 2.4
+Name: simthinkd
+Version: 0.1.0
+Summary: A 265k-parameter decision model that picks one action in about 2 ms on one CPU core, inside real-time loops.
+Author: Myeongseongsimjae AX Institute
+License: Apache-2.0
+Project-URL: Homepage, https://github.com/MSSJ-AI-ORG/simthinkd
+Project-URL: Issues, https://github.com/MSSJ-AI-ORG/simthinkd/issues
+Keywords: decision model,real-time,game AI,agents,vizdoom,imitation learning
+Classifier: Programming Language :: Python :: 3
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+License-File: NOTICE
+Requires-Dist: numpy>=1.26
+Provides-Extra: train
+Requires-Dist: torch>=2.2; extra == "train"
+Provides-Extra: mcp
+Requires-Dist: mcp>=1.2; extra == "mcp"
+Provides-Extra: langchain
+Requires-Dist: langchain-core>=0.3; extra == "langchain"
+Provides-Extra: demo
+Requires-Dist: gradio>=4.0; extra == "demo"
+Provides-Extra: onnx
+Requires-Dist: onnx>=1.15; extra == "onnx"
+Requires-Dist: onnxruntime>=1.17; extra == "onnx"
+Dynamic: license-file
+
+<p align="center"><b>SimThink D</b></p>
+
+<p align="center">
+  <a href="LICENSE"><img src="https://img.shields.io/badge/license-Apache%202.0-blue" alt="License: Apache 2.0"></a>
+  <img src="https://img.shields.io/badge/python-3.10%2B-blue" alt="Python 3.10+">
+  <a href="https://github.com/MSSJ-AI-ORG/simthinkd/actions/workflows/test.yml"><img src="https://github.com/MSSJ-AI-ORG/simthinkd/actions/workflows/test.yml/badge.svg" alt="Tests"></a>
+  <a href="https://colab.research.google.com/github/MSSJ-AI-ORG/simthinkd/blob/main/notebooks/quickstart.ipynb"><img src="https://colab.research.google.com/assets/colab-badge.svg" alt="Open in Colab"></a>
+  <a href="https://doi.org/10.5281/zenodo.23111615"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.23111615.svg" alt="DOI"></a>
+</p>
+
+**A tiny decision model that runs on one CPU core.** It has 265,665 parameters. It picks one action in about 2 ms. That is fast enough to decide inside every tick of a game or a control loop. No GPU is needed, not even for training.
+
+<p align="center">
+  <img src="assets/side_by_side.gif" alt="Same Doom game, same seed, same CPU. Left: SimThink D answers every tick. Right: a 421M-parameter general decision model, used as published, misses most ticks while it thinks." width="100%" />
+</p>
+
+<p align="center"><sub>Same game, same seed, same 6-core CPU. Left: SimThink D, 1.9 ms per decision, 1 of 420 ticks missed. Right: Laya, a 421M-parameter open decision model, used as published without training on this game. It takes about 360 ms per decision and misses 390 of 420 ticks. A dark frame means the game moved on before the decider answered.</sub></p>
+
+<div align="center">
+
+[Open in Colab](https://colab.research.google.com/github/MSSJ-AI-ORG/simthinkd/blob/main/notebooks/quickstart.ipynb) · [Try it in your browser](web/index.html) · [Gradio demo](space/) · [Paper](docs/PAPER.md) · [Protocol](docs/PROTOCOL.md)
+
+</div>
+
+Video: [a simulated factory line keeps running when the internet drops, with SimThink D deciding on the factory PC](https://www.linkedin.com/feed/update/urn:li:activity:7510142949981057024/) (LinkedIn).
+
+## Words used here
+
+- **Tick**: one step of a game or control loop. Doom runs at 35 ticks per second, so one tick is 28.6 ms.
+- **Decider**: the small model. It gets a short sentence about the situation and returns one action.
+- **Teacher**: your own rules, written as a normal function. The decider learns by copying the teacher.
+- **Perception**: your code that turns the raw game state into the short sentence.
+
+## Install
+
+```bash
+pip install "simthinkd @ git+https://github.com/MSSJ-AI-ORG/simthinkd"
+```
+
+That is all you need to make decisions. It only needs NumPy. To train your own decider, add the `train` extra (it adds PyTorch, CPU build is fine):
+
+```bash
+pip install "simthinkd[train] @ git+https://github.com/MSSJ-AI-ORG/simthinkd"
+```
+
+## Quickstart
+
+```python
+from simthinkd import Decider
+
+d = Decider("doom-defend")
+print(d.decide("seen: Demon left a30 d5 | enemies 1 | sway left | gun ready | ammo25"))
+# TURN_LEFT (100%, 1.1 ms)
+```
+
+One call is one decision. A short sentence goes in. One action comes out, with its probability and the time it took. The first call also loads the model, so it is slower. After that, a call takes about 1 ms.
+
+Two deciders come with the package: `doom-defend` (stand in the middle and fight) and `doom-corridor` (fight your way down a corridor).
+
+## Train your own in seconds
+
+A new task needs two things: a perception step and a teacher. The `toy` module below is a small made-up task, an inspection station on a factory belt. Swap its examples and actions for your own.
+
+```python
+import simthinkd
+from simthinkd import toy
+
+d = simthinkd.fit(toy.examples(3000), toy.ACTIONS, goal=toy.GOAL, out="inspection")
+print(d.decide("part: defect dent | severity severe | image clear | belt normal | rework queue long"))
+# REJECT (100%, 1.2 ms)
+```
+
+On our test PC this trains on the CPU in about 8 seconds. The new decider then matched the teacher on 500 of 500 states it had not seen.
+
+## Measure your own model
+
+Does your model fit inside one tick? `simthinkd bench` replays 1,050 recorded Doom states that ship with the package. It times every decision, one request at a time.
+
+```bash
+simthinkd bench
+simthinkd bench --url http://127.0.0.1:8000/v1/systemone --name my-model --tick-hz 35
+```
+
+The second line measures any server that accepts the [decision request](docs/PROTOCOL.md).
+
+## Same CPU, same states
+
+**Read this first.** Laya is a general model and was not trained on this game. Its published speed, about 33 ms per question, is on a GPU. We only had a CPU. So this table compares time inside a real-time loop. It does not compare overall quality.
+
+We used one workstation CPU (6 threads) and 1,050 Doom states, then 10 live games on the same seeds. "Missed ticks" are ticks that passed before the decider answered.
+
+| Decider | Parameters | Median decision time | Decisions within one 28.6 ms tick | Missed ticks in live play |
+|---|---|---|---|---|
+| SimThink D | 265,665 | 1.8 ms | 100% | 0.1% |
+| Laya, as published | about 421M | 365 ms | 0% | 84.2% |
+
+SimThink D only knows what its teacher knows. It does not reason, read long text or handle new actions without training. To run this comparison yourself, see [benchmarks/](benchmarks/).
+
+## Use it from your stack
+
+| Where | How |
+|---|---|
+| Any language, any engine | `simthinkd serve doom-defend --port 11890`, then POST the [decision request](docs/PROTOCOL.md) to `/v1/systemone` |
+| Unity / C# | [docs/INTEGRATION_UNITY.md](docs/INTEGRATION_UNITY.md): a client loop that keeps the game running while it waits |
+| Browser | [web/](web/): the same model in plain JavaScript, no server |
+| MCP (Claude Desktop, Cursor and others) | `pip install "simthinkd[mcp] @ git+https://github.com/MSSJ-AI-ORG/simthinkd"`, then `python -m simthinkd.integrations.mcp_server` |
+| LangChain / LangGraph | `from simthinkd.integrations.langchain_tool import simthinkd_tool` |
+
+## How it works
+
+- **Input**: the situation sentence, the goal and each action's description become hashed features: words, word pairs and three-letter pieces. There is no pretrained language model inside.
+- **Model**: a small two-layer network scores every offered action. It sees all actions at once and gives calibrated probabilities.
+- **Training**: it starts from random weights and learns from the teacher's choices. The best checkpoint is picked on held-out data.
+- **Why it matters**: in a 35 Hz game, a decision that takes longer than 28.6 ms is a missed tick. Our paper separates the cost of decision time from the quality of the decision ([docs/PAPER.md](docs/PAPER.md)).
+
+## Limits
+
+- At most 8 actions per decision.
+- Text input only. Turn numbers into short words or bins, like "d5" or "ammo25".
+- A decider copies its teacher. It is only as good as the teacher's rules.
+- Probabilities are calibrated for the decider's own task only.
+
+## Citation
+
+If you use SimThink D, please cite it with [CITATION.cff](CITATION.cff). GitHub shows a "Cite this repository" button for it.
+
+- Software: [doi:10.5281/zenodo.23111615](https://doi.org/10.5281/zenodo.23111615)
+- Paper (preprint): Shin, Lee, Jeong and Kwon, "Separating Decision Time from Decision Quality in the Real-Time Gap of Distilled Deciders: Evidence from a Game and a Conveyor Simulator", [doi:10.5281/zenodo.23111659](https://doi.org/10.5281/zenodo.23111659)
+
+## Contributing
+
+Bug reports and small pull requests are welcome. See [CONTRIBUTING.md](CONTRIBUTING.md).
+
+## Credits
+
+The comparison uses [Laya](https://github.com/NandhaKishorM/laya) by Convai Innovations (Apache 2.0), run unchanged through a small adapter. Doom scenes come from [ViZDoom](https://github.com/Farama-Foundation/ViZDoom). See [NOTICE](NOTICE).
+
+## License
+
+Apache 2.0. See [LICENSE](LICENSE).

simthinkd-0.1.0/README.md

@@ -0,0 +1,140 @@
+<p align="center"><b>SimThink D</b></p>
+
+<p align="center">
+  <a href="LICENSE"><img src="https://img.shields.io/badge/license-Apache%202.0-blue" alt="License: Apache 2.0"></a>
+  <img src="https://img.shields.io/badge/python-3.10%2B-blue" alt="Python 3.10+">
+  <a href="https://github.com/MSSJ-AI-ORG/simthinkd/actions/workflows/test.yml"><img src="https://github.com/MSSJ-AI-ORG/simthinkd/actions/workflows/test.yml/badge.svg" alt="Tests"></a>
+  <a href="https://colab.research.google.com/github/MSSJ-AI-ORG/simthinkd/blob/main/notebooks/quickstart.ipynb"><img src="https://colab.research.google.com/assets/colab-badge.svg" alt="Open in Colab"></a>
+  <a href="https://doi.org/10.5281/zenodo.23111615"><img src="https://zenodo.org/badge/DOI/10.5281/zenodo.23111615.svg" alt="DOI"></a>
+</p>
+
+**A tiny decision model that runs on one CPU core.** It has 265,665 parameters. It picks one action in about 2 ms. That is fast enough to decide inside every tick of a game or a control loop. No GPU is needed, not even for training.
+
+<p align="center">
+  <img src="assets/side_by_side.gif" alt="Same Doom game, same seed, same CPU. Left: SimThink D answers every tick. Right: a 421M-parameter general decision model, used as published, misses most ticks while it thinks." width="100%" />
+</p>
+
+<p align="center"><sub>Same game, same seed, same 6-core CPU. Left: SimThink D, 1.9 ms per decision, 1 of 420 ticks missed. Right: Laya, a 421M-parameter open decision model, used as published without training on this game. It takes about 360 ms per decision and misses 390 of 420 ticks. A dark frame means the game moved on before the decider answered.</sub></p>
+
+<div align="center">
+
+[Open in Colab](https://colab.research.google.com/github/MSSJ-AI-ORG/simthinkd/blob/main/notebooks/quickstart.ipynb) · [Try it in your browser](web/index.html) · [Gradio demo](space/) · [Paper](docs/PAPER.md) · [Protocol](docs/PROTOCOL.md)
+
+</div>
+
+Video: [a simulated factory line keeps running when the internet drops, with SimThink D deciding on the factory PC](https://www.linkedin.com/feed/update/urn:li:activity:7510142949981057024/) (LinkedIn).
+
+## Words used here
+
+- **Tick**: one step of a game or control loop. Doom runs at 35 ticks per second, so one tick is 28.6 ms.
+- **Decider**: the small model. It gets a short sentence about the situation and returns one action.
+- **Teacher**: your own rules, written as a normal function. The decider learns by copying the teacher.
+- **Perception**: your code that turns the raw game state into the short sentence.
+
+## Install
+
+```bash
+pip install "simthinkd @ git+https://github.com/MSSJ-AI-ORG/simthinkd"
+```
+
+That is all you need to make decisions. It only needs NumPy. To train your own decider, add the `train` extra (it adds PyTorch, CPU build is fine):
+
+```bash
+pip install "simthinkd[train] @ git+https://github.com/MSSJ-AI-ORG/simthinkd"
+```
+
+## Quickstart
+
+```python
+from simthinkd import Decider
+
+d = Decider("doom-defend")
+print(d.decide("seen: Demon left a30 d5 | enemies 1 | sway left | gun ready | ammo25"))
+# TURN_LEFT (100%, 1.1 ms)
+```
+
+One call is one decision. A short sentence goes in. One action comes out, with its probability and the time it took. The first call also loads the model, so it is slower. After that, a call takes about 1 ms.
+
+Two deciders come with the package: `doom-defend` (stand in the middle and fight) and `doom-corridor` (fight your way down a corridor).
+
+## Train your own in seconds
+
+A new task needs two things: a perception step and a teacher. The `toy` module below is a small made-up task, an inspection station on a factory belt. Swap its examples and actions for your own.
+
+```python
+import simthinkd
+from simthinkd import toy
+
+d = simthinkd.fit(toy.examples(3000), toy.ACTIONS, goal=toy.GOAL, out="inspection")
+print(d.decide("part: defect dent | severity severe | image clear | belt normal | rework queue long"))
+# REJECT (100%, 1.2 ms)
+```
+
+On our test PC this trains on the CPU in about 8 seconds. The new decider then matched the teacher on 500 of 500 states it had not seen.
+
+## Measure your own model
+
+Does your model fit inside one tick? `simthinkd bench` replays 1,050 recorded Doom states that ship with the package. It times every decision, one request at a time.
+
+```bash
+simthinkd bench
+simthinkd bench --url http://127.0.0.1:8000/v1/systemone --name my-model --tick-hz 35
+```
+
+The second line measures any server that accepts the [decision request](docs/PROTOCOL.md).
+
+## Same CPU, same states
+
+**Read this first.** Laya is a general model and was not trained on this game. Its published speed, about 33 ms per question, is on a GPU. We only had a CPU. So this table compares time inside a real-time loop. It does not compare overall quality.
+
+We used one workstation CPU (6 threads) and 1,050 Doom states, then 10 live games on the same seeds. "Missed ticks" are ticks that passed before the decider answered.
+
+| Decider | Parameters | Median decision time | Decisions within one 28.6 ms tick | Missed ticks in live play |
+|---|---|---|---|---|
+| SimThink D | 265,665 | 1.8 ms | 100% | 0.1% |
+| Laya, as published | about 421M | 365 ms | 0% | 84.2% |
+
+SimThink D only knows what its teacher knows. It does not reason, read long text or handle new actions without training. To run this comparison yourself, see [benchmarks/](benchmarks/).
+
+## Use it from your stack
+
+| Where | How |
+|---|---|
+| Any language, any engine | `simthinkd serve doom-defend --port 11890`, then POST the [decision request](docs/PROTOCOL.md) to `/v1/systemone` |
+| Unity / C# | [docs/INTEGRATION_UNITY.md](docs/INTEGRATION_UNITY.md): a client loop that keeps the game running while it waits |
+| Browser | [web/](web/): the same model in plain JavaScript, no server |
+| MCP (Claude Desktop, Cursor and others) | `pip install "simthinkd[mcp] @ git+https://github.com/MSSJ-AI-ORG/simthinkd"`, then `python -m simthinkd.integrations.mcp_server` |
+| LangChain / LangGraph | `from simthinkd.integrations.langchain_tool import simthinkd_tool` |
+
+## How it works
+
+- **Input**: the situation sentence, the goal and each action's description become hashed features: words, word pairs and three-letter pieces. There is no pretrained language model inside.
+- **Model**: a small two-layer network scores every offered action. It sees all actions at once and gives calibrated probabilities.
+- **Training**: it starts from random weights and learns from the teacher's choices. The best checkpoint is picked on held-out data.
+- **Why it matters**: in a 35 Hz game, a decision that takes longer than 28.6 ms is a missed tick. Our paper separates the cost of decision time from the quality of the decision ([docs/PAPER.md](docs/PAPER.md)).
+
+## Limits
+
+- At most 8 actions per decision.
+- Text input only. Turn numbers into short words or bins, like "d5" or "ammo25".
+- A decider copies its teacher. It is only as good as the teacher's rules.
+- Probabilities are calibrated for the decider's own task only.
+
+## Citation
+
+If you use SimThink D, please cite it with [CITATION.cff](CITATION.cff). GitHub shows a "Cite this repository" button for it.
+
+- Software: [doi:10.5281/zenodo.23111615](https://doi.org/10.5281/zenodo.23111615)
+- Paper (preprint): Shin, Lee, Jeong and Kwon, "Separating Decision Time from Decision Quality in the Real-Time Gap of Distilled Deciders: Evidence from a Game and a Conveyor Simulator", [doi:10.5281/zenodo.23111659](https://doi.org/10.5281/zenodo.23111659)
+
+## Contributing
+
+Bug reports and small pull requests are welcome. See [CONTRIBUTING.md](CONTRIBUTING.md).
+
+## Credits
+
+The comparison uses [Laya](https://github.com/NandhaKishorM/laya) by Convai Innovations (Apache 2.0), run unchanged through a small adapter. Doom scenes come from [ViZDoom](https://github.com/Farama-Foundation/ViZDoom). See [NOTICE](NOTICE).
+
+## License
+
+Apache 2.0. See [LICENSE](LICENSE).

simthinkd-0.1.0/pyproject.toml

@@ -0,0 +1,35 @@
+[build-system]
+requires = ["setuptools>=68"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "simthinkd"
+version = "0.1.0"
+description = "A 265k-parameter decision model that picks one action in about 2 ms on one CPU core, inside real-time loops."
+readme = "README.md"
+requires-python = ">=3.10"
+license = {text = "Apache-2.0"}
+authors = [{name = "Myeongseongsimjae AX Institute"}]
+dependencies = ["numpy>=1.26"]
+keywords = ["decision model", "real-time", "game AI", "agents", "vizdoom", "imitation learning"]
+classifiers = ["Programming Language :: Python :: 3", "License :: OSI Approved :: Apache Software License", "Topic :: Scientific/Engineering :: Artificial Intelligence"]
+
+[project.optional-dependencies]
+train = ["torch>=2.2"]
+mcp = ["mcp>=1.2"]
+langchain = ["langchain-core>=0.3"]
+demo = ["gradio>=4.0"]
+onnx = ["onnx>=1.15", "onnxruntime>=1.17"]
+
+[project.urls]
+Homepage = "https://github.com/MSSJ-AI-ORG/simthinkd"
+Issues = "https://github.com/MSSJ-AI-ORG/simthinkd/issues"
+
+[project.scripts]
+simthinkd = "simthinkd.cli:main"
+
+[tool.setuptools.packages.find]
+where = ["src"]
+
+[tool.setuptools.package-data]
+simthinkd = ["weights/*.npz", "weights/SHA256SUMS", "data/*.json"]

simthinkd-0.1.0/setup.cfg

@@ -0,0 +1,4 @@
+[egg_info]
+tag_build = 
+tag_date = 0
+

simthinkd-0.1.0/src/simthinkd/__init__.py

@@ -0,0 +1,15 @@
+"""SimThink D: a small decision model that picks one action in about 2 ms on one CPU core.
+
+    from simthinkd import Decider
+    print(Decider("doom-defend").decide("seen: Demon left a30 d5 | enemies 1 | sway left | gun ready | ammo25"))
+"""
+from .core import Decider, Decision, available, build_request
+
+__version__ = '0.1.0'
+__all__ = ['Decider', 'Decision', 'available', 'build_request', 'fit', '__version__']
+
+
+def fit(*args, **kwargs):
+    """Train a decider from (situation, action) pairs. See simthinkd.train.fit. Needs simthinkd[train]."""
+    from .train import fit as _fit
+    return _fit(*args, **kwargs)

simthinkd-0.1.0/src/simthinkd/bench.py

@@ -0,0 +1,55 @@
+"""Does your decider fit inside one game tick? Measures decision time and teacher agreement on recorded states.
+
+    simthinkd bench                                   # the bundled decider, in-process, bundled Doom states
+    simthinkd bench --url http://127.0.0.1:8000/v1/systemone --name my-model
+    simthinkd bench --states my_states.json --tick-hz 60
+
+Any server that accepts the decision request (PROTOCOL.md) and answers {"answers": {"operation": {"choice": ...}}}
+can be measured. States file: {"rows": [{"body": <request>, "teacher": <action>}, ...]}.
+One request at a time; the time is the full round trip seen by the caller.
+"""
+import json
+import statistics
+import time
+import urllib.request
+from pathlib import Path
+
+from .core import Decider
+
+BUNDLED = Path(__file__).resolve().parent / 'data' / 'doom_defend_states.json'
+
+
+def _post(url, body):
+    req = urllib.request.Request(url, data=json.dumps(body).encode(), headers={'Content-Type': 'application/json'})
+    with urllib.request.urlopen(req, timeout=300) as reply:
+        return json.load(reply)['answers']['operation']['choice']
+
+
+def run(states=None, url=None, decider='doom-defend', name=None, tick_hz=35.0, warmup=20, limit=0):
+    rows = json.loads(Path(states or BUNDLED).read_text(encoding='utf8'))['rows']
+    rows = rows[:limit] if limit else rows
+    if url:
+        call, label = (lambda body: _post(url, body)), name or url
+    else:
+        d = decider if isinstance(decider, Decider) else Decider(decider)
+        call, label = (lambda body: d.predict(body)['operation']['choice']), name or f'simthink-d:{d.preset["name"]}'
+    for row in rows[:warmup]:
+        call(row['body'])
+    times, agree = [], 0
+    for row in rows:
+        start = time.perf_counter()
+        choice = call(row['body'])
+        times.append((time.perf_counter() - start) * 1000)
+        agree += choice == row['teacher']
+    q = sorted(times)
+    tick_ms = 1000.0 / tick_hz
+    return {'name': label, 'states': len(rows), 'tick_ms': round(tick_ms, 2),
+            'p50_ms': round(statistics.median(q), 3), 'p95_ms': round(q[max(0, int(0.95 * len(q)) - 1)], 3),
+            'within_one_tick': round(sum(t <= tick_ms for t in times) / len(times), 4),
+            'teacher_agreement': round(agree / len(rows), 4)}
+
+
+def report(result):
+    return (f"{result['name']}: median {result['p50_ms']} ms, p95 {result['p95_ms']} ms, "
+            f"{result['within_one_tick']:.1%} of decisions within one {result['tick_ms']} ms tick, "
+            f"teacher agreement {result['teacher_agreement']:.1%} on {result['states']} states")