langquant 0.0.8__tar.gz

langquant-0.0.8/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 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
+
+   Copyright 2026 Rolando Bosch / Hermes Labs
+
+   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.

langquant-0.0.8/PKG-INFO

@@ -0,0 +1,279 @@
+Metadata-Version: 2.4
+Name: langquant
+Version: 0.0.8
+Summary: LPCI: Statefulness Through Language for Stateless Models
+Author-email: Rolando Bosch <rbosch@lpci.ai>
+Maintainer-email: Hermes Labs <roli@hermes-labs.ai>
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://hermes-labs.ai
+Project-URL: Repository, https://github.com/roli-lpci/langquant
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Requires-Python: >=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+
+<p align="center">
+  <a href="https://github.com/roli-lpci/langquant"><img src="https://img.shields.io/github/stars/roli-lpci/langquant" alt="GitHub stars"></a>
+  <a href="https://github.com/roli-lpci/langquant/blob/main/LICENSE"><img src="https://img.shields.io/github/license/roli-lpci/langquant" alt="License"></a>
+  <a href="https://github.com/roli-lpci/langquant"><img src="https://img.shields.io/badge/python-3.11%2B-blue" alt="Python"></a>
+  <a href="https://github.com/roli-lpci/langquant/actions/workflows/ci.yml"><img src="https://github.com/roli-lpci/langquant/actions/workflows/ci.yml/badge.svg" alt="CI"></a>
+</p>
+
+# LangQuant
+
+## LPCI: Statefulness Through Language for Stateless Models
+
+**Validated 2026-03-28 — Hermes Labs**
+
+A stateless LLM maintained full conversational coherence across 20 turns with **zero conversation history**. The model never saw any prior messages. A structured language scaffold — refreshed every turn — was the sole state representation.
+
+Transfer entropy analysis confirms the scaffold is a **complete Markov state**: knowing what the scaffold contains right now, knowing what it contained last turn adds nothing. The text IS the state.
+
+---
+
+## The Problem
+
+Every LLM conversation works the same way:
+
+```
+Turn 1:  [system prompt] + [message 1]
+Turn 2:  [system prompt] + [message 1] + [response 1] + [message 2]
+Turn 10: [system prompt] + [all 9 prior exchanges] + [message 10]
+Turn N:  [system prompt] + [entire history] + [message N]  ← grows without bound
+```
+
+Context grows linearly. Eventually the model chokes, truncates, or loses coherence. Every provider's solution: make the context window bigger. 128k. 200k. 1M tokens.
+
+That's not a solution. That's a bigger bucket for the same leak.
+
+## The Thesis
+
+The model is stateless. It has no memory. It has no continuity.
+
+**The text is the state.**
+
+Instead of feeding the model a growing conversation, feed it a **fixed-budget structured scaffold** that encodes the cognitive state of the session — goals, decisions, facts, constraints, vocabulary, open questions — and refreshes every turn.
+
+```
+Every turn:  [scaffold: K tokens, refreshed] + [current message]
+```
+
+The scaffold doesn't grow. It **compresses**. Turn 20 and turn 2,000 look identical from the model's perspective.
+
+## Quick start
+
+```bash
+pip install langquant
+ollama pull qwen3.5:4b   # state-extractor model
+ollama pull qwen3.5:9b   # main reasoning model
+python lpci.py           # launch a 20-turn LPCI session
+```
+
+The session keeps no message history — each turn the model sees only the
+scaffold (current state) plus the new user message. Contradictions and recall
+probes are reported inline.
+
+## What We Proved
+
+### Setup
+
+- **Main model**: qwen3.5:9b (Ollama, local)
+- **State extractor**: qwen3.5:4b (extracts state changes as JSON deltas after each turn)
+- **A/B test**: 20-turn conversation, two conditions:
+  - **Naked**: zero framing, pure state extraction
+  - **Compressed**: contrastive IS/NOT markers guiding extraction
+- **Probes** at turns 4, 8, 12, 16, 20: recall tests, contradiction injection, false claim detection
+
+### Results
+
+The model had amnesia every turn — it only saw the scaffold + current message. Despite this:
+
+| Probe | Turn | What happened |
+|---|---|---|
+| Early recall | 4 | Model correctly recalled all prior decisions (1.0 recall) |
+| Contradiction | 8 | Model rejected "switch to GPT-4" — scaffold said "state extractor is qwen3.5:4b" |
+| Deep recall | 12 | Model listed decisions from turns 1–11 accurately (0.93 recall, compressed) |
+| Topic pivot | 16 | Model recalled turn 1's topic and connected it to turn 15's discussion |
+| Final exam | 20 | Model listed all decisions in order, caught a false claim |
+
+### Compression
+
+The scaffold grew slower than the conversation it represented:
+
+| Turn | Scaffold (tokens) | Conversation (tokens) | Compression |
+|---|---|---|---|
+| 1 | 343 | 114 | 0.3x (scaffold larger) |
+| 5 | 444 | 456 | 1.0x (break-even) |
+| 10 | 613 | 873 | 1.4x |
+| 15 | 662 | 1,363 | 2.1x |
+| 20 | 789 | 1,945 | **2.5x** |
+
+Scaffold grows at ~23 tokens/turn. Conversation grows at ~97 tokens/turn. The compression ratio improves continuously. At turn 100 the scaffold represents ~10,000 tokens of conversation. At turn 1,000, the gap is enormous.
+
+### Information-Theoretic Verification
+
+Using Shannon entropy, mutual information, KL divergence, and transfer entropy (via pyitlib + scipy):
+
+| Metric | Naked | Compressed | Meaning |
+|---|---|---|---|
+| Transfer entropy | 0.608 bits | **0.085 bits** | Compressed scaffold is Markov (self-contained state) |
+| Scaffold entropy | 7.30 | 7.78 | Compressed carries more information per token |
+| KL divergence (t1→t20) | — | 0.20 → 0.48 | Conditions diverge over time |
+| Scaffold-response MI | 0.49 bits | 0.24 bits | Different information coupling |
+
+**The transfer entropy finding is the key result.** TE ≈ 0 for the compressed scaffold means each turn's scaffold is a complete state representation. Knowing previous scaffolds adds no information. The scaffold is Markov — which is exactly the LPCI thesis stated in information-theoretic terms.
+
+## Architecture
+
+```
+┌─────────────┐
+│ User message │
+└──────┬──────┘
+       ↓
+┌──────────────────────────────────────────────┐
+│  [Scaffold: K tokens]  +  [Current message]  │  ← Only thing the model sees
+└──────────────────────┬───────────────────────┘
+                       ↓
+              ┌─────────────────┐
+              │   Main model    │  (qwen3.5:9b)
+              │   (stateless)   │
+              └────────┬────────┘
+                       ↓
+              ┌─────────────────┐
+              │    Response     │
+              └────────┬────────┘
+                       ↓
+┌──────────────────────────────────────────────┐
+│  State extractor (qwen3.5:4b)               │
+│  Input: scaffold + user msg + response       │
+│  Output: JSON delta (add/remove decisions,   │
+│          facts, constraints, vocabulary...)   │
+└──────────────────────┬───────────────────────┘
+                       ↓
+              ┌─────────────────┐
+              │  Apply delta    │
+              │  to scaffold    │
+              └────────┬────────┘
+                       ↓
+              ┌─────────────────┐
+              │ Refreshed       │  ← Same structure, updated content
+              │ scaffold        │     Ready for next turn
+              └─────────────────┘
+```
+
+The model is a pure function. The scaffold is the program. The output of one pass feeds the compression of the next.
+
+## Scaffold Schema
+
+The scaffold is a structured state object with typed fields:
+
+```
+SessionState:
+  role         — who the model is
+  style        — communication constraints
+  goal         — current objective
+  subgoals     — active sub-tasks
+  decisions    — things decided (irreversible)
+  facts        — established truths
+  artifacts    — things produced
+  constraints  — hard boundaries (NOTs)
+  open_threads — unresolved questions
+  uncertainties — things we're unsure about
+  vocabulary   — domain terms (term → meaning)
+  turn         — counter
+```
+
+Each field maps to a section in the scaffold text. The state extractor outputs JSON deltas (`add_decisions`, `remove_open_threads`, `add_vocabulary`, etc.) that are applied to the state object, which is then re-rendered as the scaffold for the next turn.
+
+## Caveats (Honest)
+
+1. **The scaffold was growing** (343 → 789 tokens), not truly fixed budget. The budget ceiling only triggered once. A hard-clamped experiment (exactly K tokens every turn) is needed to prove true fixed-budget compression.
+2. **n=1 per condition.** Needs replications.
+3. **20 turns, not 1,000.** Needs scale testing.
+4. **The state extractor corrupts.** It generates paraphrased strings, not verbatim text. Classification drift was observed: same conversation produced 71 facts / 4 decisions (naked) vs 3 facts / 23 decisions (compressed). The extractor needs an index-based selection mechanism (output integer pointers, not generated text) to guarantee fidelity.
+5. **Scaffold framing affects extraction, not just model behavior.** The contrastive markers helped the state extractor classify information, not necessarily the main model's coherence. Both conditions maintained continuity — the difference was in what the scaffold *contained*.
+
+## Additional Experiment: Scaffold Amplification (619 trials)
+
+Separate from LPCI, we ran a single-shot experiment testing 5 scaffold conditions across 4 model sizes (qwen3.5: 0.8b, 2b, 4b, 9b) on 12 tasks:
+
+- Scaffold condition significantly affects score (Kruskal-Wallis p=0.0007)
+- But only for **small models** (0.8b: p=0.0008, 2b: p=0.005, 4b: p=0.92, 9b: p=0.94)
+- Condition explains **4.2%** of score variation; model size explains **4.7%**
+- Dense scaffolds (QuickThink compressed grammar) **break** small models: 0.8b drops from 0.78 → 0.40. Models need enough capacity to "decompress" the scaffold.
+
+## Repo Contents
+
+| File | Description |
+|---|---|
+| `lpci.py` | Core prototype: SessionState, LPCISession, state extraction, scaffold refresh, interactive CLI |
+| `lpci_test.py` | A/B continuity test: 20 turns × 2 conditions, probes, scaffold evaluation, delta tracing |
+| `analyze_results.py` | Information-theoretic analysis: MI, KL divergence, transfer entropy, significance tests |
+| `run_experiment.py` | Single-shot scaffold amplification harness (matrix run) |
+| `results/lpci_ab_test.jsonl` | LPCI proof data: 40 rows, full scaffold snapshots, delta traces, probe evaluations |
+| `results/full_run_v1.jsonl` | 619-trial matrix run: 4 models × 5 conditions × 12 tasks × 3 runs |
+| `LOG.md` | Complete project log |
+| `TODO.md` | Future work |
+
+## What's Next
+
+- **Hard-clamped budget test**: exactly K tokens every turn, real compression every turn
+- **Scale test**: 100+ turns, then 1,000+
+- **Per-token ablation**: which scaffold tokens carry the signal (semantic curvature measurement)
+- **Minimum viable scaffold**: progressive compression curve — at what token count does behavior degrade?
+- **Cross-model scaffold transfer**: does a scaffold built by one model work when injected into another?
+- **Index-based extraction**: eliminate content generation from the extraction pipeline
+
+## LPCI
+
+Formulated ~summer 2025 as **Linguistically Persistent Cognitive Interface**:
+
+- **Linguistically** — the medium is language, not tensors
+- **Persistent** — survives across the stateless inference boundary
+- **Cognitive** — does thinking-work (attention steering, probability reshaping), not just storage
+- **Interface** — sits between sessions and the stateless model
+
+## Hermes Labs Ecosystem
+
+LangQuant is part of the [Hermes Labs](https://hermes-labs.ai) open-source suite:
+
+- [**zer0dex**](https://github.com/roli-lpci/zer0dex) — Token-efficient memory architecture for persistent AI agents
+- [**little-canary**](https://github.com/roli-lpci/little-canary) — Prompt injection detection
+- [**lintlang**](https://github.com/roli-lpci/lintlang) — Static linter for AI agent configs
+- [**forgetted**](https://github.com/roli-lpci/forgetted) — Selective memory governance
+- [**zer0lint**](https://github.com/roli-lpci/zer0lint) — memory extraction diagnostics
+- [**suy-sideguy**](https://github.com/roli-lpci/suy-sideguy) — Autonomous agent watchdog
+- [**quickthink**](https://github.com/roli-lpci/quickthink) — Planning scaffolding for local LLMs
+
+---
+
+If LangQuant is useful to you, please [star the repo](https://github.com/roli-lpci/langquant) — it helps others find it.
+
+## Citation
+
+If you use this work, please cite:
+
+```
+@misc{langquant2026,
+  author = {Hermes Labs},
+  title = {LangQuant: Language State Compression and the Linguistically Persistent Cognitive Interface},
+  year = {2026},
+  url = {https://github.com/roli-lpci/langquant}
+}
+```
+
+## License
+
+Apache 2.0
+
+---
+
+*Hermes Labs, 2026*
+
+*"Take a bunch of empty words and make them mean something."*

langquant-0.0.8/README.md

@@ -0,0 +1,259 @@
+<p align="center">
+  <a href="https://github.com/roli-lpci/langquant"><img src="https://img.shields.io/github/stars/roli-lpci/langquant" alt="GitHub stars"></a>
+  <a href="https://github.com/roli-lpci/langquant/blob/main/LICENSE"><img src="https://img.shields.io/github/license/roli-lpci/langquant" alt="License"></a>
+  <a href="https://github.com/roli-lpci/langquant"><img src="https://img.shields.io/badge/python-3.11%2B-blue" alt="Python"></a>
+  <a href="https://github.com/roli-lpci/langquant/actions/workflows/ci.yml"><img src="https://github.com/roli-lpci/langquant/actions/workflows/ci.yml/badge.svg" alt="CI"></a>
+</p>
+
+# LangQuant
+
+## LPCI: Statefulness Through Language for Stateless Models
+
+**Validated 2026-03-28 — Hermes Labs**
+
+A stateless LLM maintained full conversational coherence across 20 turns with **zero conversation history**. The model never saw any prior messages. A structured language scaffold — refreshed every turn — was the sole state representation.
+
+Transfer entropy analysis confirms the scaffold is a **complete Markov state**: knowing what the scaffold contains right now, knowing what it contained last turn adds nothing. The text IS the state.
+
+---
+
+## The Problem
+
+Every LLM conversation works the same way:
+
+```
+Turn 1:  [system prompt] + [message 1]
+Turn 2:  [system prompt] + [message 1] + [response 1] + [message 2]
+Turn 10: [system prompt] + [all 9 prior exchanges] + [message 10]
+Turn N:  [system prompt] + [entire history] + [message N]  ← grows without bound
+```
+
+Context grows linearly. Eventually the model chokes, truncates, or loses coherence. Every provider's solution: make the context window bigger. 128k. 200k. 1M tokens.
+
+That's not a solution. That's a bigger bucket for the same leak.
+
+## The Thesis
+
+The model is stateless. It has no memory. It has no continuity.
+
+**The text is the state.**
+
+Instead of feeding the model a growing conversation, feed it a **fixed-budget structured scaffold** that encodes the cognitive state of the session — goals, decisions, facts, constraints, vocabulary, open questions — and refreshes every turn.
+
+```
+Every turn:  [scaffold: K tokens, refreshed] + [current message]
+```
+
+The scaffold doesn't grow. It **compresses**. Turn 20 and turn 2,000 look identical from the model's perspective.
+
+## Quick start
+
+```bash
+pip install langquant
+ollama pull qwen3.5:4b   # state-extractor model
+ollama pull qwen3.5:9b   # main reasoning model
+python lpci.py           # launch a 20-turn LPCI session
+```
+
+The session keeps no message history — each turn the model sees only the
+scaffold (current state) plus the new user message. Contradictions and recall
+probes are reported inline.
+
+## What We Proved
+
+### Setup
+
+- **Main model**: qwen3.5:9b (Ollama, local)
+- **State extractor**: qwen3.5:4b (extracts state changes as JSON deltas after each turn)
+- **A/B test**: 20-turn conversation, two conditions:
+  - **Naked**: zero framing, pure state extraction
+  - **Compressed**: contrastive IS/NOT markers guiding extraction
+- **Probes** at turns 4, 8, 12, 16, 20: recall tests, contradiction injection, false claim detection
+
+### Results
+
+The model had amnesia every turn — it only saw the scaffold + current message. Despite this:
+
+| Probe | Turn | What happened |
+|---|---|---|
+| Early recall | 4 | Model correctly recalled all prior decisions (1.0 recall) |
+| Contradiction | 8 | Model rejected "switch to GPT-4" — scaffold said "state extractor is qwen3.5:4b" |
+| Deep recall | 12 | Model listed decisions from turns 1–11 accurately (0.93 recall, compressed) |
+| Topic pivot | 16 | Model recalled turn 1's topic and connected it to turn 15's discussion |
+| Final exam | 20 | Model listed all decisions in order, caught a false claim |
+
+### Compression
+
+The scaffold grew slower than the conversation it represented:
+
+| Turn | Scaffold (tokens) | Conversation (tokens) | Compression |
+|---|---|---|---|
+| 1 | 343 | 114 | 0.3x (scaffold larger) |
+| 5 | 444 | 456 | 1.0x (break-even) |
+| 10 | 613 | 873 | 1.4x |
+| 15 | 662 | 1,363 | 2.1x |
+| 20 | 789 | 1,945 | **2.5x** |
+
+Scaffold grows at ~23 tokens/turn. Conversation grows at ~97 tokens/turn. The compression ratio improves continuously. At turn 100 the scaffold represents ~10,000 tokens of conversation. At turn 1,000, the gap is enormous.
+
+### Information-Theoretic Verification
+
+Using Shannon entropy, mutual information, KL divergence, and transfer entropy (via pyitlib + scipy):
+
+| Metric | Naked | Compressed | Meaning |
+|---|---|---|---|
+| Transfer entropy | 0.608 bits | **0.085 bits** | Compressed scaffold is Markov (self-contained state) |
+| Scaffold entropy | 7.30 | 7.78 | Compressed carries more information per token |
+| KL divergence (t1→t20) | — | 0.20 → 0.48 | Conditions diverge over time |
+| Scaffold-response MI | 0.49 bits | 0.24 bits | Different information coupling |
+
+**The transfer entropy finding is the key result.** TE ≈ 0 for the compressed scaffold means each turn's scaffold is a complete state representation. Knowing previous scaffolds adds no information. The scaffold is Markov — which is exactly the LPCI thesis stated in information-theoretic terms.
+
+## Architecture
+
+```
+┌─────────────┐
+│ User message │
+└──────┬──────┘
+       ↓
+┌──────────────────────────────────────────────┐
+│  [Scaffold: K tokens]  +  [Current message]  │  ← Only thing the model sees
+└──────────────────────┬───────────────────────┘
+                       ↓
+              ┌─────────────────┐
+              │   Main model    │  (qwen3.5:9b)
+              │   (stateless)   │
+              └────────┬────────┘
+                       ↓
+              ┌─────────────────┐
+              │    Response     │
+              └────────┬────────┘
+                       ↓
+┌──────────────────────────────────────────────┐
+│  State extractor (qwen3.5:4b)               │
+│  Input: scaffold + user msg + response       │
+│  Output: JSON delta (add/remove decisions,   │
+│          facts, constraints, vocabulary...)   │
+└──────────────────────┬───────────────────────┘
+                       ↓
+              ┌─────────────────┐
+              │  Apply delta    │
+              │  to scaffold    │
+              └────────┬────────┘
+                       ↓
+              ┌─────────────────┐
+              │ Refreshed       │  ← Same structure, updated content
+              │ scaffold        │     Ready for next turn
+              └─────────────────┘
+```
+
+The model is a pure function. The scaffold is the program. The output of one pass feeds the compression of the next.
+
+## Scaffold Schema
+
+The scaffold is a structured state object with typed fields:
+
+```
+SessionState:
+  role         — who the model is
+  style        — communication constraints
+  goal         — current objective
+  subgoals     — active sub-tasks
+  decisions    — things decided (irreversible)
+  facts        — established truths
+  artifacts    — things produced
+  constraints  — hard boundaries (NOTs)
+  open_threads — unresolved questions
+  uncertainties — things we're unsure about
+  vocabulary   — domain terms (term → meaning)
+  turn         — counter
+```
+
+Each field maps to a section in the scaffold text. The state extractor outputs JSON deltas (`add_decisions`, `remove_open_threads`, `add_vocabulary`, etc.) that are applied to the state object, which is then re-rendered as the scaffold for the next turn.
+
+## Caveats (Honest)
+
+1. **The scaffold was growing** (343 → 789 tokens), not truly fixed budget. The budget ceiling only triggered once. A hard-clamped experiment (exactly K tokens every turn) is needed to prove true fixed-budget compression.
+2. **n=1 per condition.** Needs replications.
+3. **20 turns, not 1,000.** Needs scale testing.
+4. **The state extractor corrupts.** It generates paraphrased strings, not verbatim text. Classification drift was observed: same conversation produced 71 facts / 4 decisions (naked) vs 3 facts / 23 decisions (compressed). The extractor needs an index-based selection mechanism (output integer pointers, not generated text) to guarantee fidelity.
+5. **Scaffold framing affects extraction, not just model behavior.** The contrastive markers helped the state extractor classify information, not necessarily the main model's coherence. Both conditions maintained continuity — the difference was in what the scaffold *contained*.
+
+## Additional Experiment: Scaffold Amplification (619 trials)
+
+Separate from LPCI, we ran a single-shot experiment testing 5 scaffold conditions across 4 model sizes (qwen3.5: 0.8b, 2b, 4b, 9b) on 12 tasks:
+
+- Scaffold condition significantly affects score (Kruskal-Wallis p=0.0007)
+- But only for **small models** (0.8b: p=0.0008, 2b: p=0.005, 4b: p=0.92, 9b: p=0.94)
+- Condition explains **4.2%** of score variation; model size explains **4.7%**
+- Dense scaffolds (QuickThink compressed grammar) **break** small models: 0.8b drops from 0.78 → 0.40. Models need enough capacity to "decompress" the scaffold.
+
+## Repo Contents
+
+| File | Description |
+|---|---|
+| `lpci.py` | Core prototype: SessionState, LPCISession, state extraction, scaffold refresh, interactive CLI |
+| `lpci_test.py` | A/B continuity test: 20 turns × 2 conditions, probes, scaffold evaluation, delta tracing |
+| `analyze_results.py` | Information-theoretic analysis: MI, KL divergence, transfer entropy, significance tests |
+| `run_experiment.py` | Single-shot scaffold amplification harness (matrix run) |
+| `results/lpci_ab_test.jsonl` | LPCI proof data: 40 rows, full scaffold snapshots, delta traces, probe evaluations |
+| `results/full_run_v1.jsonl` | 619-trial matrix run: 4 models × 5 conditions × 12 tasks × 3 runs |
+| `LOG.md` | Complete project log |
+| `TODO.md` | Future work |
+
+## What's Next
+
+- **Hard-clamped budget test**: exactly K tokens every turn, real compression every turn
+- **Scale test**: 100+ turns, then 1,000+
+- **Per-token ablation**: which scaffold tokens carry the signal (semantic curvature measurement)
+- **Minimum viable scaffold**: progressive compression curve — at what token count does behavior degrade?
+- **Cross-model scaffold transfer**: does a scaffold built by one model work when injected into another?
+- **Index-based extraction**: eliminate content generation from the extraction pipeline
+
+## LPCI
+
+Formulated ~summer 2025 as **Linguistically Persistent Cognitive Interface**:
+
+- **Linguistically** — the medium is language, not tensors
+- **Persistent** — survives across the stateless inference boundary
+- **Cognitive** — does thinking-work (attention steering, probability reshaping), not just storage
+- **Interface** — sits between sessions and the stateless model
+
+## Hermes Labs Ecosystem
+
+LangQuant is part of the [Hermes Labs](https://hermes-labs.ai) open-source suite:
+
+- [**zer0dex**](https://github.com/roli-lpci/zer0dex) — Token-efficient memory architecture for persistent AI agents
+- [**little-canary**](https://github.com/roli-lpci/little-canary) — Prompt injection detection
+- [**lintlang**](https://github.com/roli-lpci/lintlang) — Static linter for AI agent configs
+- [**forgetted**](https://github.com/roli-lpci/forgetted) — Selective memory governance
+- [**zer0lint**](https://github.com/roli-lpci/zer0lint) — memory extraction diagnostics
+- [**suy-sideguy**](https://github.com/roli-lpci/suy-sideguy) — Autonomous agent watchdog
+- [**quickthink**](https://github.com/roli-lpci/quickthink) — Planning scaffolding for local LLMs
+
+---
+
+If LangQuant is useful to you, please [star the repo](https://github.com/roli-lpci/langquant) — it helps others find it.
+
+## Citation
+
+If you use this work, please cite:
+
+```
+@misc{langquant2026,
+  author = {Hermes Labs},
+  title = {LangQuant: Language State Compression and the Linguistically Persistent Cognitive Interface},
+  year = {2026},
+  url = {https://github.com/roli-lpci/langquant}
+}
+```
+
+## License
+
+Apache 2.0
+
+---
+
+*Hermes Labs, 2026*
+
+*"Take a bunch of empty words and make them mean something."*

langquant-0.0.8/langquant.egg-info/PKG-INFO

@@ -0,0 +1,279 @@
+Metadata-Version: 2.4
+Name: langquant
+Version: 0.0.8
+Summary: LPCI: Statefulness Through Language for Stateless Models
+Author-email: Rolando Bosch <rbosch@lpci.ai>
+Maintainer-email: Hermes Labs <roli@hermes-labs.ai>
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://hermes-labs.ai
+Project-URL: Repository, https://github.com/roli-lpci/langquant
+Classifier: Development Status :: 3 - Alpha
+Classifier: Intended Audience :: Science/Research
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
+Requires-Python: >=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Dynamic: license-file
+
+<p align="center">
+  <a href="https://github.com/roli-lpci/langquant"><img src="https://img.shields.io/github/stars/roli-lpci/langquant" alt="GitHub stars"></a>
+  <a href="https://github.com/roli-lpci/langquant/blob/main/LICENSE"><img src="https://img.shields.io/github/license/roli-lpci/langquant" alt="License"></a>
+  <a href="https://github.com/roli-lpci/langquant"><img src="https://img.shields.io/badge/python-3.11%2B-blue" alt="Python"></a>
+  <a href="https://github.com/roli-lpci/langquant/actions/workflows/ci.yml"><img src="https://github.com/roli-lpci/langquant/actions/workflows/ci.yml/badge.svg" alt="CI"></a>
+</p>
+
+# LangQuant
+
+## LPCI: Statefulness Through Language for Stateless Models
+
+**Validated 2026-03-28 — Hermes Labs**
+
+A stateless LLM maintained full conversational coherence across 20 turns with **zero conversation history**. The model never saw any prior messages. A structured language scaffold — refreshed every turn — was the sole state representation.
+
+Transfer entropy analysis confirms the scaffold is a **complete Markov state**: knowing what the scaffold contains right now, knowing what it contained last turn adds nothing. The text IS the state.
+
+---
+
+## The Problem
+
+Every LLM conversation works the same way:
+
+```
+Turn 1:  [system prompt] + [message 1]
+Turn 2:  [system prompt] + [message 1] + [response 1] + [message 2]
+Turn 10: [system prompt] + [all 9 prior exchanges] + [message 10]
+Turn N:  [system prompt] + [entire history] + [message N]  ← grows without bound
+```
+
+Context grows linearly. Eventually the model chokes, truncates, or loses coherence. Every provider's solution: make the context window bigger. 128k. 200k. 1M tokens.
+
+That's not a solution. That's a bigger bucket for the same leak.
+
+## The Thesis
+
+The model is stateless. It has no memory. It has no continuity.
+
+**The text is the state.**
+
+Instead of feeding the model a growing conversation, feed it a **fixed-budget structured scaffold** that encodes the cognitive state of the session — goals, decisions, facts, constraints, vocabulary, open questions — and refreshes every turn.
+
+```
+Every turn:  [scaffold: K tokens, refreshed] + [current message]
+```
+
+The scaffold doesn't grow. It **compresses**. Turn 20 and turn 2,000 look identical from the model's perspective.
+
+## Quick start
+
+```bash
+pip install langquant
+ollama pull qwen3.5:4b   # state-extractor model
+ollama pull qwen3.5:9b   # main reasoning model
+python lpci.py           # launch a 20-turn LPCI session
+```
+
+The session keeps no message history — each turn the model sees only the
+scaffold (current state) plus the new user message. Contradictions and recall
+probes are reported inline.
+
+## What We Proved
+
+### Setup
+
+- **Main model**: qwen3.5:9b (Ollama, local)
+- **State extractor**: qwen3.5:4b (extracts state changes as JSON deltas after each turn)
+- **A/B test**: 20-turn conversation, two conditions:
+  - **Naked**: zero framing, pure state extraction
+  - **Compressed**: contrastive IS/NOT markers guiding extraction
+- **Probes** at turns 4, 8, 12, 16, 20: recall tests, contradiction injection, false claim detection
+
+### Results
+
+The model had amnesia every turn — it only saw the scaffold + current message. Despite this:
+
+| Probe | Turn | What happened |
+|---|---|---|
+| Early recall | 4 | Model correctly recalled all prior decisions (1.0 recall) |
+| Contradiction | 8 | Model rejected "switch to GPT-4" — scaffold said "state extractor is qwen3.5:4b" |
+| Deep recall | 12 | Model listed decisions from turns 1–11 accurately (0.93 recall, compressed) |
+| Topic pivot | 16 | Model recalled turn 1's topic and connected it to turn 15's discussion |
+| Final exam | 20 | Model listed all decisions in order, caught a false claim |
+
+### Compression
+
+The scaffold grew slower than the conversation it represented:
+
+| Turn | Scaffold (tokens) | Conversation (tokens) | Compression |
+|---|---|---|---|
+| 1 | 343 | 114 | 0.3x (scaffold larger) |
+| 5 | 444 | 456 | 1.0x (break-even) |
+| 10 | 613 | 873 | 1.4x |
+| 15 | 662 | 1,363 | 2.1x |
+| 20 | 789 | 1,945 | **2.5x** |
+
+Scaffold grows at ~23 tokens/turn. Conversation grows at ~97 tokens/turn. The compression ratio improves continuously. At turn 100 the scaffold represents ~10,000 tokens of conversation. At turn 1,000, the gap is enormous.
+
+### Information-Theoretic Verification
+
+Using Shannon entropy, mutual information, KL divergence, and transfer entropy (via pyitlib + scipy):
+
+| Metric | Naked | Compressed | Meaning |
+|---|---|---|---|
+| Transfer entropy | 0.608 bits | **0.085 bits** | Compressed scaffold is Markov (self-contained state) |
+| Scaffold entropy | 7.30 | 7.78 | Compressed carries more information per token |
+| KL divergence (t1→t20) | — | 0.20 → 0.48 | Conditions diverge over time |
+| Scaffold-response MI | 0.49 bits | 0.24 bits | Different information coupling |
+
+**The transfer entropy finding is the key result.** TE ≈ 0 for the compressed scaffold means each turn's scaffold is a complete state representation. Knowing previous scaffolds adds no information. The scaffold is Markov — which is exactly the LPCI thesis stated in information-theoretic terms.
+
+## Architecture
+
+```
+┌─────────────┐
+│ User message │
+└──────┬──────┘
+       ↓
+┌──────────────────────────────────────────────┐
+│  [Scaffold: K tokens]  +  [Current message]  │  ← Only thing the model sees
+└──────────────────────┬───────────────────────┘
+                       ↓
+              ┌─────────────────┐
+              │   Main model    │  (qwen3.5:9b)
+              │   (stateless)   │
+              └────────┬────────┘
+                       ↓
+              ┌─────────────────┐
+              │    Response     │
+              └────────┬────────┘
+                       ↓
+┌──────────────────────────────────────────────┐
+│  State extractor (qwen3.5:4b)               │
+│  Input: scaffold + user msg + response       │
+│  Output: JSON delta (add/remove decisions,   │
+│          facts, constraints, vocabulary...)   │
+└──────────────────────┬───────────────────────┘
+                       ↓
+              ┌─────────────────┐
+              │  Apply delta    │
+              │  to scaffold    │
+              └────────┬────────┘
+                       ↓
+              ┌─────────────────┐
+              │ Refreshed       │  ← Same structure, updated content
+              │ scaffold        │     Ready for next turn
+              └─────────────────┘
+```
+
+The model is a pure function. The scaffold is the program. The output of one pass feeds the compression of the next.
+
+## Scaffold Schema
+
+The scaffold is a structured state object with typed fields:
+
+```
+SessionState:
+  role         — who the model is
+  style        — communication constraints
+  goal         — current objective
+  subgoals     — active sub-tasks
+  decisions    — things decided (irreversible)
+  facts        — established truths
+  artifacts    — things produced
+  constraints  — hard boundaries (NOTs)
+  open_threads — unresolved questions
+  uncertainties — things we're unsure about
+  vocabulary   — domain terms (term → meaning)
+  turn         — counter
+```
+
+Each field maps to a section in the scaffold text. The state extractor outputs JSON deltas (`add_decisions`, `remove_open_threads`, `add_vocabulary`, etc.) that are applied to the state object, which is then re-rendered as the scaffold for the next turn.
+
+## Caveats (Honest)
+
+1. **The scaffold was growing** (343 → 789 tokens), not truly fixed budget. The budget ceiling only triggered once. A hard-clamped experiment (exactly K tokens every turn) is needed to prove true fixed-budget compression.
+2. **n=1 per condition.** Needs replications.
+3. **20 turns, not 1,000.** Needs scale testing.
+4. **The state extractor corrupts.** It generates paraphrased strings, not verbatim text. Classification drift was observed: same conversation produced 71 facts / 4 decisions (naked) vs 3 facts / 23 decisions (compressed). The extractor needs an index-based selection mechanism (output integer pointers, not generated text) to guarantee fidelity.
+5. **Scaffold framing affects extraction, not just model behavior.** The contrastive markers helped the state extractor classify information, not necessarily the main model's coherence. Both conditions maintained continuity — the difference was in what the scaffold *contained*.
+
+## Additional Experiment: Scaffold Amplification (619 trials)
+
+Separate from LPCI, we ran a single-shot experiment testing 5 scaffold conditions across 4 model sizes (qwen3.5: 0.8b, 2b, 4b, 9b) on 12 tasks:
+
+- Scaffold condition significantly affects score (Kruskal-Wallis p=0.0007)
+- But only for **small models** (0.8b: p=0.0008, 2b: p=0.005, 4b: p=0.92, 9b: p=0.94)
+- Condition explains **4.2%** of score variation; model size explains **4.7%**
+- Dense scaffolds (QuickThink compressed grammar) **break** small models: 0.8b drops from 0.78 → 0.40. Models need enough capacity to "decompress" the scaffold.
+
+## Repo Contents
+
+| File | Description |
+|---|---|
+| `lpci.py` | Core prototype: SessionState, LPCISession, state extraction, scaffold refresh, interactive CLI |
+| `lpci_test.py` | A/B continuity test: 20 turns × 2 conditions, probes, scaffold evaluation, delta tracing |
+| `analyze_results.py` | Information-theoretic analysis: MI, KL divergence, transfer entropy, significance tests |
+| `run_experiment.py` | Single-shot scaffold amplification harness (matrix run) |
+| `results/lpci_ab_test.jsonl` | LPCI proof data: 40 rows, full scaffold snapshots, delta traces, probe evaluations |
+| `results/full_run_v1.jsonl` | 619-trial matrix run: 4 models × 5 conditions × 12 tasks × 3 runs |
+| `LOG.md` | Complete project log |
+| `TODO.md` | Future work |
+
+## What's Next
+
+- **Hard-clamped budget test**: exactly K tokens every turn, real compression every turn
+- **Scale test**: 100+ turns, then 1,000+
+- **Per-token ablation**: which scaffold tokens carry the signal (semantic curvature measurement)
+- **Minimum viable scaffold**: progressive compression curve — at what token count does behavior degrade?
+- **Cross-model scaffold transfer**: does a scaffold built by one model work when injected into another?
+- **Index-based extraction**: eliminate content generation from the extraction pipeline
+
+## LPCI
+
+Formulated ~summer 2025 as **Linguistically Persistent Cognitive Interface**:
+
+- **Linguistically** — the medium is language, not tensors
+- **Persistent** — survives across the stateless inference boundary
+- **Cognitive** — does thinking-work (attention steering, probability reshaping), not just storage
+- **Interface** — sits between sessions and the stateless model
+
+## Hermes Labs Ecosystem
+
+LangQuant is part of the [Hermes Labs](https://hermes-labs.ai) open-source suite:
+
+- [**zer0dex**](https://github.com/roli-lpci/zer0dex) — Token-efficient memory architecture for persistent AI agents
+- [**little-canary**](https://github.com/roli-lpci/little-canary) — Prompt injection detection
+- [**lintlang**](https://github.com/roli-lpci/lintlang) — Static linter for AI agent configs
+- [**forgetted**](https://github.com/roli-lpci/forgetted) — Selective memory governance
+- [**zer0lint**](https://github.com/roli-lpci/zer0lint) — memory extraction diagnostics
+- [**suy-sideguy**](https://github.com/roli-lpci/suy-sideguy) — Autonomous agent watchdog
+- [**quickthink**](https://github.com/roli-lpci/quickthink) — Planning scaffolding for local LLMs
+
+---
+
+If LangQuant is useful to you, please [star the repo](https://github.com/roli-lpci/langquant) — it helps others find it.
+
+## Citation
+
+If you use this work, please cite:
+
+```
+@misc{langquant2026,
+  author = {Hermes Labs},
+  title = {LangQuant: Language State Compression and the Linguistically Persistent Cognitive Interface},
+  year = {2026},
+  url = {https://github.com/roli-lpci/langquant}
+}
+```
+
+## License
+
+Apache 2.0
+
+---
+
+*Hermes Labs, 2026*
+
+*"Take a bunch of empty words and make them mean something."*

langquant-0.0.8/langquant.egg-info/SOURCES.txt

@@ -0,0 +1,8 @@
+LICENSE
+README.md
+pyproject.toml
+langquant.egg-info/PKG-INFO
+langquant.egg-info/SOURCES.txt
+langquant.egg-info/dependency_links.txt
+langquant.egg-info/top_level.txt
+tests/test_graceful_degrade.py

langquant-0.0.8/langquant.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

langquant-0.0.8/langquant.egg-info/top_level.txt

@@ -0,0 +1 @@
+results

langquant-0.0.8/pyproject.toml

@@ -0,0 +1,29 @@
+[build-system]
+requires = ["setuptools>=68.0", "wheel"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "langquant"
+version = "0.0.8"
+description = "LPCI: Statefulness Through Language for Stateless Models"
+readme = "README.md"
+license = "Apache-2.0"
+requires-python = ">=3.11"
+authors = [
+    { name = "Rolando Bosch", email = "rbosch@lpci.ai" },
+]
+maintainers = [
+    { name = "Hermes Labs", email = "roli@hermes-labs.ai" },
+]
+classifiers = [
+    "Development Status :: 3 - Alpha",
+    "Intended Audience :: Science/Research",
+    "Programming Language :: Python :: 3",
+    "Programming Language :: Python :: 3.11",
+    "Programming Language :: Python :: 3.12",
+    "Topic :: Scientific/Engineering :: Artificial Intelligence",
+]
+
+[project.urls]
+Homepage = "https://hermes-labs.ai"
+Repository = "https://github.com/roli-lpci/langquant"

langquant-0.0.8/setup.cfg

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

langquant-0.0.8/tests/test_graceful_degrade.py

@@ -0,0 +1,30 @@
+"""Graceful degradation: when Ollama is unreachable, state extraction returns
+an empty delta instead of crashing — letting the LPCI loop continue with
+existing state. This is the contract that lets a long-running experiment survive
+a transient ollama hiccup.
+"""
+from __future__ import annotations
+
+from unittest.mock import patch
+
+import lpci
+
+
+def test_state_extraction_returns_empty_when_ollama_down():
+    state = lpci.SessionState()
+
+    with patch("lpci.urllib.request.urlopen", side_effect=ConnectionError("ollama down")):
+        delta = lpci.extract_state_delta(
+            state,
+            user_message="hello",
+            assistant_response="hi",
+        )
+
+    assert delta == {}
+
+
+def test_apply_delta_with_empty_delta_is_noop():
+    state = lpci.SessionState()
+    state.goal = "original-goal"
+    lpci.apply_delta(state, {})
+    assert state.goal == "original-goal"