Modular Reasoning Scaffold (MRS) – a lightweight meta-reasoning layer for small LLMs.
This project has been archived.
The maintainers of this project have marked this project as archived. No new releases are expected.
Project description
SPDX-License-Identifier: Apache-2.0
Copyright 2025 RJ Sabouhi
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.
MRS v1.0 — Modular Recursion Scaffold
A lightweight architectural layer for controlled recursive reasoning in small LLMs
Overview
Modern language models show emergent reasoning capabilities only once they reach large parameter scales.
MRS (Modular Recursion Scaffold) provides an architectural alternative:
a structural layer that gives even very small models the ability to maintain intermediate variables, reuse prior states, and perform stable multi-step reasoning.
MRS does not modify the underlying model.
It wraps it with:
- Memory slots
- State update rules
- Invariant structural constraints
- Recursion operators
This gives a tiny model the functional profile of a much larger one, without requiring scale.
Why This Matters
Most lightweight models fail at reasoning because they cannot:
- Store intermediate results
- Correct their own trajectories
- Maintain stable representations over recursive steps
MRS adds these abilities explicitly through structure rather than scale.
It is model-agnostic, parameter-free, and computationally cheap.
This makes it ideal for:
- On-device / low-resource models
- Custom agents
- Safety layers
- Interpretability research
- Experiments in emergent behavior at small scale
Core Concepts
1. Structural Slots (S)
Named containers that hold intermediate reasoning variables.
Example:
S = {s0, s1, s2, …}
Slots persist across recursion steps.
2. Update Rules (U)
Explicit functions controlling how each slot transforms.
Each U is stable, monotonic, or self-correcting.
3. Constraint Layer (C)
A lightweight rule set ensuring:
- bounded drift
- state coherence
- step-to-step consistency
C acts like a guardrail system for stability.
4. Recursion Operator (R)
The loop engine:
R(S, U, C) → S′
applied until termination or max depth.
This combination gives a small model the equivalent of “scratchpad reasoning” without needing the internal capacity of a large transformer.
Minimal Reference Implementation (C1)
class MRS:
def __init__(self, num_slots=4, max_depth=8):
self.S = [None] * num_slots # structural slots
self.depth = 0
self.max_depth = max_depth
def update(self, model, prompt):
self.depth += 1
state_repr = {f"s{i}": v for i, v in enumerate(self.S)}
inp = {"prompt": prompt, "state": state_repr}
out = model(inp)
for i in range(len(self.S)):
self.S[i] = out.get(f"s{i}", self.S[i])
if self.depth > self.max_depth:
return self.S, True
return self.S, False
def run(self, model, prompt):
done = False
while not done:
_, done = self.update(model, prompt)
return self.S
Intended Use
mrs = MRS()
result = mrs.run(small_llm, "Solve this in steps.")
What MRS Enables
- Stable chain-of-thought
- Deterministic recursive loops
- Intermediate variable tracking
- Multi-pass self-correction
- Mild emergent behavior without scale
- Interpretability-friendly internal state
- Reduced hallucination drift
- Structured reasoning on models as small as 100M parameters
Roadmap
v1.0
- Base scaffold
- 4 slots
- Simple update rule
- Basic drift constraints
- Terminal recursion depth
v1.1
- Weighted slot updates
- Error-corrective constraints
- Deterministic rollback mode
v2.0
- Hierarchical recursion
- Specialized slot types
- Cross-slot influence graphs
- Stability metrics
- Metastability detector
- External verifier mode
License
Apache 2.0
Citation
RJ Sabouhi (2025). Modular Recursion Scaffold v1.0.#
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file mrs_scaffold-1.1.8.tar.gz.
File metadata
- Download URL: mrs_scaffold-1.1.8.tar.gz
- Upload date:
- Size: 9.2 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.2.0 CPython/3.13.5
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
9328fe30b4c3fc3d4320617ff0c31cc41836799a49008773e8d9003fdb00d20a
|
|
| MD5 |
addbc85feef3983a36a483fdc50fc30d
|
|
| BLAKE2b-256 |
3d09817c7ae316b1f363825379cee43c96fb20f860afcc0a5e07d8b9c733087f
|
File details
Details for the file mrs_scaffold-1.1.8-py3-none-any.whl.
File metadata
- Download URL: mrs_scaffold-1.1.8-py3-none-any.whl
- Upload date:
- Size: 12.3 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.2.0 CPython/3.13.5
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
53fccf5cfec44ecb5672b057c27bba696f6988351309ab68543c577c498ad11d
|
|
| MD5 |
0ef0d10449dfa9f93e348580396d3ff5
|
|
| BLAKE2b-256 |
6e0fdecaf06befd23327e2a650857ae2874ea7917ace7135116d3a901cc264f6
|