meme-core 0.1.0__tar.gz

meme_core-0.1.0/LICENSE

@@ -0,0 +1,190 @@
+                                 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 the 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 usage,
+      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
+
+   Copyright 2026 Abel
+
+   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.

meme_core-0.1.0/PKG-INFO

@@ -0,0 +1,257 @@
+Metadata-Version: 2.5
+Name: meme-core
+Version: 0.1.0
+Summary: Memory-Compute Pareto analysis core: guarded memory strategies and solver-based Best-of-N
+Project-URL: Homepage, https://github.com/abel/meme-llm
+Project-URL: Documentation, https://github.com/abel/meme-llm#readme
+Project-URL: Repository, https://github.com/abel/meme-llm
+Project-URL: Issues, https://github.com/abel/meme-llm/issues
+Project-URL: Changelog, https://github.com/abel/meme-llm/blob/main/CHANGELOG.md
+Author-email: Abel <abel@example.com>
+License-Expression: Apache-2.0
+License-File: LICENSE
+Keywords: best-of-n,compute,constraint-solver,inference,llm,memory,pareto,small-language-models,structured-memory,test-time
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: Apache Software License
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.10
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Classifier: Topic :: Scientific/Engineering :: Mathematics
+Requires-Python: >=3.10
+Provides-Extra: dev
+Requires-Dist: black>=23.0; extra == 'dev'
+Requires-Dist: mypy>=1.0; extra == 'dev'
+Requires-Dist: pytest-cov>=4.0; extra == 'dev'
+Requires-Dist: pytest>=7.0; extra == 'dev'
+Requires-Dist: ruff>=0.1; extra == 'dev'
+Description-Content-Type: text/markdown
+
+# meme-core
+
+> **Memory-Compute Pareto analysis core** — guarded memory strategies and solver-based Best-of-N for small language models
+
+[![PyPI version](https://img.shields.io/pypi/v/meme-core.svg)](https://pypi.org/project/meme-core/)
+[![Python](https://img.shields.io/pypi/pyversions/meme-core.svg)](https://pypi.org/project/meme-core/)
+[![License](https://img.shields.io/badge/license-Apache--2.0-blue.svg)](LICENSE)
+
+## What is this?
+
+**meme-core** extracts two key techniques from the [MEME project](https://github.com/abel/meme-llm) as a standalone Python library:
+
+### 1. Guarded Memory Strategies (`guard`)
+
+Structured memory reliably **hurts** pure-retrieval tasks by 30–50pp across every model tested. The guard removes this penalty entirely by falling back to plain prose when there is nothing to structure.
+
+**Key insight (MEME v3.7):**
+- Without guard: M3 on TriviaQA drops 60% (from 100%) — model relies on shattered question fragments
+- With guard (M3G/M3Q): Returns to 100% — prose fallback prevents damage
+
+**Authority framing matters:**
+- **Block-authoritative** (M*G): Best for constraint-satisfaction tasks (ZebraLogic)
+- **Question-authoritative** (M*Q): Best for retrieval tasks (TriviaQA, HotpotQA)
+
+See [`guard`](src/meme_core/guard/) for implementation.
+
+### 2. Solver-based Best-of-N (`solver_bon`)
+
+Best-of-N without a verifier has no selection criterion and degenerates to a random sample. Using a constraint solver as the reward model makes BoN deterministic and maximally effective for constraint-satisfaction tasks.
+
+**Key insight (MEME v3.9):**
+- For tasks with verified unique solutions (ZebraLogic, GSM8K-Hard), the constraint solver IS the ground truth
+- No LLM call needed for verification — deterministic, reproducible, perfect accuracy
+
+See [`solver_bon`](src/meme_core/solver_bon/) for implementation.
+
+## Installation
+
+```bash
+pip install meme-core
+```
+
+Or from source:
+
+```bash
+pip install -e .
+```
+
+## Quick Start
+
+### Guarded Memory
+
+```python
+from meme_core.guard import GuardedMemory, Problem
+
+# Create a problem (e.g., from JSONL data)
+problem = Problem(
+    id=1,
+    question="Who is the engineer? There are 5 people: Alice, Bob, Carol, Dan, Eve.",
+    expected="Alice",
+    constraints=[
+        "Alice is the engineer",
+        "Bob is the doctor", 
+        "Carol is the teacher",
+        "Dan is not the engineer",
+        "Eve is the lawyer"
+    ],
+    structure_kind="constraints"  # Key: tells guard what material exists
+)
+
+# Use a guarded strategy
+# M3G: Block-authoritative (recommended for constraint tasks)
+# M3Q: Question-authoritative (recommended for retrieval tasks)
+strategy = GuardedMemory(strategy="M3G")
+prompt = strategy.render(problem)
+
+print(prompt)
+# Output includes entity-grouped facts with "Using ONLY" authority claim
+```
+
+**When structure_kind="none", the guard falls back to plain prose:**
+
+```python
+problem = Problem(
+    id=2,
+    question="What is the capital of France?",
+    expected="Paris",
+    constraints=[],
+    structure_kind="none"  # No structure → prose fallback
+)
+
+strategy = GuardedMemory(strategy="M3G")
+prompt = strategy.render(problem)
+# Returns plain M0-style prose, not empty scaffold
+```
+
+### Best-of-N with Constraint Solver
+
+```python
+from meme_core.solver_bon import best_of_n, ConstraintSolver, Problem
+
+problem = Problem(
+    id=1,
+    question="Who is the engineer?",
+    expected="lawyer",
+    aliases=["advocate", "attorney"]  # Acceptable variants
+)
+
+# Candidate answers from N model samples at temperature 0.7
+answers = ["doctor", "lawyer", "engineer", "lawyer"]
+
+# Select best using ground-truth constraint solver
+winner, scores = best_of_n(answers, problem, use_solver=True)
+
+print(f"Winner: {winner}")  # "lawyer"
+print(f"Scores: {[s.confidence for s in scores]}")  # [0, 100, 0, 100]
+```
+
+## Memory Strategies
+
+| Strategy | Description | Use Case |
+|----------|-------------|----------|
+| `M0` | Raw prose question (baseline) | Control / pure retrieval |
+| `M1` | Full context + enumerate constraints | General purpose |
+| `M2` | Structured bullet constraints | Compression |
+| `M3` | Entity-grouped facts (auto-extracted) | Entity-centric reasoning |
+| `M4` | Knowledge-graph triples | Relationship reasoning |
+| `M2G/M3G/M4G` | Guarded + block-authoritative | Constraint tasks (recommended) |
+| `M2Q/M3Q/M4Q` | Guarded + question-authoritative | Retrieval tasks (recommended) |
+
+## The `structure_kind` Field
+
+Problems declare what auxiliary material they provide, which determines guard behavior:
+
+| structure_kind | Example Task | Guard Behavior |
+|----------------|--------------|----------------|
+| `constraints` | ZebraLogic | Organize constraints into structured view |
+| `quantities` | GSM8K-Hard | Organize numeric givens |
+| `options` | ARC | Organize answer choices |
+| `facts` | HotpotQA | Organize facts for chaining |
+| `none` | TriviaQA, HumanEval | **Fall back to prose** (no scaffold) |
+
+## Architecture
+
+```
+meme_core/
+├── __init__.py           # Package entry point
+├── guard/
+│   ├── __init__.py       # Guard module exports
+│   ├── core.py           # GuardedMemory class, render_prompt, Problem
+│   └── templates.py      # Prompt templates
+└── solver_bon/
+    ├── __init__.py       # Solver BoN exports
+    └── core.py           # ConstraintSolver, best_of_n, normalize_for_comparison
+```
+
+## Example: gemma4:26b Performance Improvement
+
+A real example showing how meme-core's `solver_bon` improves gemma4:26b accuracy:
+
+```bash
+python3 examples/gemma4_26b_improvement.py
+```
+
+**Output:**
+
+```
+📊 gemma4:26b Accuracy Comparison: Greedy vs. Best-of-N
+----------------------------------------------------------------------
+Task                 Greedy       BoN          Δ        Notes
+----------------------------------------------------------------------
+ZebraLogic (hard)       70%          90%       +20pp 🎯  (major gain!)
+HumanEval               90%         100%       +10pp 🎯  
+GSM8K-Hard              90%          90%       0pp      
+ARC                    100%         100%       0pp      (saturated)
+----------------------------------------------------------------------
+Average               87.5%        95.0%       +7.5pp
+```
+
+**Key insight:** Best-of-N without a verifier degenerates to random sampling. Using a constraint solver as the reward model makes answer selection deterministic and maximally effective.
+
+## Key Results (from MEME project)
+
+### Guard removes retrieval penalty completely
+
+| Task | M0 | M3 (unguarded) | M3G | M3Q |
+|------|-----|-----------------|-----|-----|
+| TriviaQA | 100% | 60% | **100%** | **100%** |
+| HotpotQA | 90% | 60% | **90%** | **90%** |
+| GSM8K-Hard | 70% | 70% | **80%** | 70% |
+| ARC | 90% | 100% | 90% | **100%** |
+
+Cross-vendor验证: llama3.2:3b on TriviaQA 40% → **90%**; phi3.5 70% → **100%**
+
+### Guarded strategies are robust across model families
+
+| Model | TriviaQA (M3→M3G) | HotpotQA (M3→M3G) |
+|-------|---------------------|---------------------|
+| qwen3:1.7b | +40pp | +30pp |
+| qwen3:8b | +30pp | +30pp |
+| llama3.2:3b | +50pp | — |
+| phi3.5 | +30pp | — |
+
+## Citation
+
+If you use meme-core in your research, please cite:
+
+```bibtex
+@misc{meme2026,
+  title  = {Memory is the Cheap Axis: Pareto Analysis of Test-Time Memory
+            and Compute for Small Language Models},
+  author = {Abel},
+  year   = {2026},
+  note   = {Preprint, https://github.com/abel/meme-llm}
+}
+```
+
+## References
+
+- [MEME Project (meme-llm)](https://github.com/abel/meme-llm) — Full research project with data, code, and results
+- [Paper (arXiv)](https://arxiv.org/abs/XXXX.XXXXX) — Full methodology and results (TODO: update with actual link)
+
+## License
+
+Apache 2.0 — see [LICENSE](LICENSE) for details.

meme_core-0.1.0/README.md

@@ -0,0 +1,225 @@
+# meme-core
+
+> **Memory-Compute Pareto analysis core** — guarded memory strategies and solver-based Best-of-N for small language models
+
+[![PyPI version](https://img.shields.io/pypi/v/meme-core.svg)](https://pypi.org/project/meme-core/)
+[![Python](https://img.shields.io/pypi/pyversions/meme-core.svg)](https://pypi.org/project/meme-core/)
+[![License](https://img.shields.io/badge/license-Apache--2.0-blue.svg)](LICENSE)
+
+## What is this?
+
+**meme-core** extracts two key techniques from the [MEME project](https://github.com/abel/meme-llm) as a standalone Python library:
+
+### 1. Guarded Memory Strategies (`guard`)
+
+Structured memory reliably **hurts** pure-retrieval tasks by 30–50pp across every model tested. The guard removes this penalty entirely by falling back to plain prose when there is nothing to structure.
+
+**Key insight (MEME v3.7):**
+- Without guard: M3 on TriviaQA drops 60% (from 100%) — model relies on shattered question fragments
+- With guard (M3G/M3Q): Returns to 100% — prose fallback prevents damage
+
+**Authority framing matters:**
+- **Block-authoritative** (M*G): Best for constraint-satisfaction tasks (ZebraLogic)
+- **Question-authoritative** (M*Q): Best for retrieval tasks (TriviaQA, HotpotQA)
+
+See [`guard`](src/meme_core/guard/) for implementation.
+
+### 2. Solver-based Best-of-N (`solver_bon`)
+
+Best-of-N without a verifier has no selection criterion and degenerates to a random sample. Using a constraint solver as the reward model makes BoN deterministic and maximally effective for constraint-satisfaction tasks.
+
+**Key insight (MEME v3.9):**
+- For tasks with verified unique solutions (ZebraLogic, GSM8K-Hard), the constraint solver IS the ground truth
+- No LLM call needed for verification — deterministic, reproducible, perfect accuracy
+
+See [`solver_bon`](src/meme_core/solver_bon/) for implementation.
+
+## Installation
+
+```bash
+pip install meme-core
+```
+
+Or from source:
+
+```bash
+pip install -e .
+```
+
+## Quick Start
+
+### Guarded Memory
+
+```python
+from meme_core.guard import GuardedMemory, Problem
+
+# Create a problem (e.g., from JSONL data)
+problem = Problem(
+    id=1,
+    question="Who is the engineer? There are 5 people: Alice, Bob, Carol, Dan, Eve.",
+    expected="Alice",
+    constraints=[
+        "Alice is the engineer",
+        "Bob is the doctor", 
+        "Carol is the teacher",
+        "Dan is not the engineer",
+        "Eve is the lawyer"
+    ],
+    structure_kind="constraints"  # Key: tells guard what material exists
+)
+
+# Use a guarded strategy
+# M3G: Block-authoritative (recommended for constraint tasks)
+# M3Q: Question-authoritative (recommended for retrieval tasks)
+strategy = GuardedMemory(strategy="M3G")
+prompt = strategy.render(problem)
+
+print(prompt)
+# Output includes entity-grouped facts with "Using ONLY" authority claim
+```
+
+**When structure_kind="none", the guard falls back to plain prose:**
+
+```python
+problem = Problem(
+    id=2,
+    question="What is the capital of France?",
+    expected="Paris",
+    constraints=[],
+    structure_kind="none"  # No structure → prose fallback
+)
+
+strategy = GuardedMemory(strategy="M3G")
+prompt = strategy.render(problem)
+# Returns plain M0-style prose, not empty scaffold
+```
+
+### Best-of-N with Constraint Solver
+
+```python
+from meme_core.solver_bon import best_of_n, ConstraintSolver, Problem
+
+problem = Problem(
+    id=1,
+    question="Who is the engineer?",
+    expected="lawyer",
+    aliases=["advocate", "attorney"]  # Acceptable variants
+)
+
+# Candidate answers from N model samples at temperature 0.7
+answers = ["doctor", "lawyer", "engineer", "lawyer"]
+
+# Select best using ground-truth constraint solver
+winner, scores = best_of_n(answers, problem, use_solver=True)
+
+print(f"Winner: {winner}")  # "lawyer"
+print(f"Scores: {[s.confidence for s in scores]}")  # [0, 100, 0, 100]
+```
+
+## Memory Strategies
+
+| Strategy | Description | Use Case |
+|----------|-------------|----------|
+| `M0` | Raw prose question (baseline) | Control / pure retrieval |
+| `M1` | Full context + enumerate constraints | General purpose |
+| `M2` | Structured bullet constraints | Compression |
+| `M3` | Entity-grouped facts (auto-extracted) | Entity-centric reasoning |
+| `M4` | Knowledge-graph triples | Relationship reasoning |
+| `M2G/M3G/M4G` | Guarded + block-authoritative | Constraint tasks (recommended) |
+| `M2Q/M3Q/M4Q` | Guarded + question-authoritative | Retrieval tasks (recommended) |
+
+## The `structure_kind` Field
+
+Problems declare what auxiliary material they provide, which determines guard behavior:
+
+| structure_kind | Example Task | Guard Behavior |
+|----------------|--------------|----------------|
+| `constraints` | ZebraLogic | Organize constraints into structured view |
+| `quantities` | GSM8K-Hard | Organize numeric givens |
+| `options` | ARC | Organize answer choices |
+| `facts` | HotpotQA | Organize facts for chaining |
+| `none` | TriviaQA, HumanEval | **Fall back to prose** (no scaffold) |
+
+## Architecture
+
+```
+meme_core/
+├── __init__.py           # Package entry point
+├── guard/
+│   ├── __init__.py       # Guard module exports
+│   ├── core.py           # GuardedMemory class, render_prompt, Problem
+│   └── templates.py      # Prompt templates
+└── solver_bon/
+    ├── __init__.py       # Solver BoN exports
+    └── core.py           # ConstraintSolver, best_of_n, normalize_for_comparison
+```
+
+## Example: gemma4:26b Performance Improvement
+
+A real example showing how meme-core's `solver_bon` improves gemma4:26b accuracy:
+
+```bash
+python3 examples/gemma4_26b_improvement.py
+```
+
+**Output:**
+
+```
+📊 gemma4:26b Accuracy Comparison: Greedy vs. Best-of-N
+----------------------------------------------------------------------
+Task                 Greedy       BoN          Δ        Notes
+----------------------------------------------------------------------
+ZebraLogic (hard)       70%          90%       +20pp 🎯  (major gain!)
+HumanEval               90%         100%       +10pp 🎯  
+GSM8K-Hard              90%          90%       0pp      
+ARC                    100%         100%       0pp      (saturated)
+----------------------------------------------------------------------
+Average               87.5%        95.0%       +7.5pp
+```
+
+**Key insight:** Best-of-N without a verifier degenerates to random sampling. Using a constraint solver as the reward model makes answer selection deterministic and maximally effective.
+
+## Key Results (from MEME project)
+
+### Guard removes retrieval penalty completely
+
+| Task | M0 | M3 (unguarded) | M3G | M3Q |
+|------|-----|-----------------|-----|-----|
+| TriviaQA | 100% | 60% | **100%** | **100%** |
+| HotpotQA | 90% | 60% | **90%** | **90%** |
+| GSM8K-Hard | 70% | 70% | **80%** | 70% |
+| ARC | 90% | 100% | 90% | **100%** |
+
+Cross-vendor验证: llama3.2:3b on TriviaQA 40% → **90%**; phi3.5 70% → **100%**
+
+### Guarded strategies are robust across model families
+
+| Model | TriviaQA (M3→M3G) | HotpotQA (M3→M3G) |
+|-------|---------------------|---------------------|
+| qwen3:1.7b | +40pp | +30pp |
+| qwen3:8b | +30pp | +30pp |
+| llama3.2:3b | +50pp | — |
+| phi3.5 | +30pp | — |
+
+## Citation
+
+If you use meme-core in your research, please cite:
+
+```bibtex
+@misc{meme2026,
+  title  = {Memory is the Cheap Axis: Pareto Analysis of Test-Time Memory
+            and Compute for Small Language Models},
+  author = {Abel},
+  year   = {2026},
+  note   = {Preprint, https://github.com/abel/meme-llm}
+}
+```
+
+## References
+
+- [MEME Project (meme-llm)](https://github.com/abel/meme-llm) — Full research project with data, code, and results
+- [Paper (arXiv)](https://arxiv.org/abs/XXXX.XXXXX) — Full methodology and results (TODO: update with actual link)
+
+## License
+
+Apache 2.0 — see [LICENSE](LICENSE) for details.