fpf-thinking-map 1.4.3__tar.gz → 1.4.4__tar.gz

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (28) hide show
  1. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/PKG-INFO +17 -17
  2. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/README.md +11 -11
  3. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/README.md +6 -6
  4. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/SOURCES.md +1 -1
  5. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map.egg-info/PKG-INFO +17 -17
  6. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/pyproject.toml +6 -6
  7. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/LICENSE +0 -0
  8. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/ADVISORIES.md +0 -0
  9. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/FPF_AUDIT_RESPONSE.md +0 -0
  10. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/FPF_FLOOR_MAP.md +0 -0
  11. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/FPF_SOURCE_TO_CODE_RELATION_AUDIT.md +0 -0
  12. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/REJECTED_C32_CANDIDATE_SYNTHESIS.md +0 -0
  13. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/REJECTED_NQD_OEE_CULTURAL_EVOLUTION.md +0 -0
  14. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/RELATED_WORK_GOFLOW_FPF_SKILL.md +0 -0
  15. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/WHY_THIS_EXISTS.md +0 -0
  16. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/__init__.py +0 -0
  17. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/examples.py +0 -0
  18. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/guards.py +0 -0
  19. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/logic.py +0 -0
  20. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/primitives.py +0 -0
  21. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/py.typed +0 -0
  22. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/state.py +0 -0
  23. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/traversal.py +0 -0
  24. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map/verify.py +0 -0
  25. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map.egg-info/SOURCES.txt +0 -0
  26. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map.egg-info/dependency_links.txt +0 -0
  27. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/fpf_thinking_map.egg-info/top_level.txt +0 -0
  28. {fpf_thinking_map-1.4.3 → fpf_thinking_map-1.4.4}/setup.cfg +0 -0
@@ -1,13 +1,13 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: fpf-thinking-map
3
- Version: 1.4.3
4
- Summary: Agentic thinking map structured reasoning constraints for LLMs with TTL evidence decay, deterministic guards, and propositional logic glue. Compiled from FPF (First Principles Framework).
3
+ Version: 1.4.4
4
+ Summary: Agentic thinking map for bounded LLM traversal, with TTL evidence decay, deterministic guards, and propositional logic. Compiled from FPF (First Principles Framework).
5
5
  Author-email: "prichindel.com" <igareosh@igareosh.com>
6
6
  License-Expression: MIT
7
- Project-URL: Homepage, https://github.com/igareosh/prichindel.com-agentic-thinking-map
8
- Project-URL: Repository, https://github.com/igareosh/prichindel.com-agentic-thinking-map
9
- Project-URL: Documentation, https://github.com/igareosh/prichindel.com-agentic-thinking-map#readme
10
- Project-URL: Issues, https://github.com/igareosh/prichindel.com-agentic-thinking-map/issues
7
+ Project-URL: Homepage, https://github.com/igareosh/fpf-agentic-thinking-map
8
+ Project-URL: Repository, https://github.com/igareosh/fpf-agentic-thinking-map
9
+ Project-URL: Documentation, https://github.com/igareosh/fpf-agentic-thinking-map#readme
10
+ Project-URL: Issues, https://github.com/igareosh/fpf-agentic-thinking-map/issues
11
11
  Keywords: agentic,thinking-map,llm,reasoning,propositional-logic,evidence-decay,ttl,guards,gates,semantic-map,fpf
12
12
  Classifier: Development Status :: 4 - Beta
13
13
  Classifier: Intended Audience :: Developers
@@ -34,9 +34,9 @@ A Python package that gives a model a bounded move board instead of a giant fram
34
34
 
35
35
  ## Why this exists
36
36
 
37
- FPF is valuable, but it is large, clumsy at runtime, and poorly shaped for direct model consumption. A human can read a 51k-line framework, understand its distinctions, and apply them carefully. A model usually does something else: it absorbs the vocabulary, performs the tone of the framework, and still drifts on the actual task.
37
+ FPF is valuable, but it is large at runtime and not well shaped for direct model consumption. A human can read a 51k-line framework, understand its distinctions, and apply them carefully. A model often does something narrower: it absorbs the vocabulary, mirrors the posture of rigor, and still drifts on the actual task.
38
38
 
39
- This package exists because the useful part is not making the model sound more scientific. The useful part is compiling the parts of FPF that help operational decisions into something small, explicit, and inspectable. We took what mattered for bounded traversal, left out what would bloat or bias the model, and evolved the result as publishers of a practical library rather than trying to reproduce the whole upstream framework inside another AI mega-system.
39
+ This package exists because the useful part is not making the model sound more scientific. The useful part is compiling the parts of FPF that help operational decisions into something small, explicit, and inspectable. We kept the parts that matter for bounded traversal, left out parts that would bloat or bias the model, and published the result as a practical library rather than as a reproduction of the full upstream framework.
40
40
 
41
41
  The goal is simple: give the model enough structure to behave understandably, without building a cage so elaborate that it becomes another source of drift.
42
42
 
@@ -53,7 +53,7 @@ In practice this does two useful things:
53
53
  - it reduces unexplained drift by moving state tracking and hard checks out of freeform model reasoning
54
54
  - it gives the model simple, understandable outcomes such as `CONTINUE`, `COLLECT_EVIDENCE`, `BRIDGE`, `IDLE`, `ESCALATE`, instead of making it reconstruct its own epistemic condition from scratch
55
55
 
56
- This is not a panacea. Models still miss information. They still drift. But with a bounded traversal map, the failure mode becomes much easier to explain: missing evidence, wrong context, blocked move, stale basis, unlicensed bridge. The weirdness gets smaller because the state is smaller.
56
+ This is not a panacea. Models still miss information. They still drift. With a bounded traversal map, however, the failure mode becomes easier to explain: missing evidence, wrong context, blocked move, stale basis, unlicensed bridge. The state is smaller, so the failure surface is easier to inspect.
57
57
 
58
58
  ## Provable practical gains
59
59
 
@@ -65,7 +65,7 @@ The improvements here are intentionally simple and operational:
65
65
  - smaller runtime payload, because the model gets a slice, not a corpus
66
66
  - easier debugging, because outcomes are discrete and inspectable
67
67
 
68
- That is the whole point: practical gain, not intellectual theater.
68
+ That is the whole point: practical gain, stated plainly and checked in code.
69
69
 
70
70
  ## Quick start
71
71
 
@@ -105,7 +105,7 @@ fpf_thinking_map/
105
105
 
106
106
  `verify.py` proves the engine's own logic is internally consistent. It doesn't prove the compiled map covers the breadth of the original FPF spec — `examples.py` has one domain, five scenarios. `dev_mcp/` is an MCP server for constructing scenarios ad hoc and driving them against the documents that already ground FPF semantics in this repo: `SOURCES.md` (which spec section each primitive is supposed to enforce), `FPF_SOURCE_TO_CODE_RELATION_AUDIT.md` (a cited 50-item gap backlog), and `ADVISORIES.md` (deliberate-minimalism findings for integrators — not defects, but real defaults you should know about before assuming they match your domain).
107
107
 
108
- Not shipped in the package — `pyproject.toml` only builds `fpf_thinking_map*`, so this stays a repo-only dev tool by construction, for whoever's interested enough to dig past `pip install`. `run_scenario` requires a `scope`: `"core"` for testing this library's own shipped primitives (our responsibility, our tracking), `"user-extension"` for testing a domain map built on top (your responsibility, your repo). Full docs, install steps, self-test, worked example: [dev_mcp/README.md](dev_mcp/README.md).
108
+ Not shipped in the package — `pyproject.toml` only builds `fpf_thinking_map*`, so this stays a repo-only development tool by construction. `run_scenario` requires a `scope`: `"core"` for testing this library's own shipped primitives (publisher tracking in this repo), `"user-extension"` for testing a domain map built on top (consumer tracking in the integrating repo). Full docs, install steps, self-test, and a worked example are in [dev_mcp/README.md](dev_mcp/README.md).
109
109
 
110
110
  ## Relationship to ailev/FPF
111
111
 
@@ -164,7 +164,7 @@ fpf does not ship better reasoning. It ships **inspectability**: did the agent f
164
164
 
165
165
  Take the stagnation counter as the concrete case. It bounds repetition — but only if the integration maps one real attempt to one `step()` call, and only adds evidence when something genuinely new was found. Whether that actually catches a real LLM thrashing depends entirely on whether the calling harness wires evidence honestly, not just "a tool returned something." That wiring discipline lives outside this library, in whatever integrates it — an agent loop, an MCP server, application code. fpf can't verify that discipline was followed; it can only guarantee that if it was, repetition is bounded.
166
166
 
167
- That boundary is the correct seam, not a gap to apologize for. Judging whether a piece of evidence is actually meaningful is a semantic question, and semantic questions need prompting, an LLM judge, or domain logic to answer which is exactly where that belongs: outside fpf, at the evidence-wiring layer, not folded into a library whose entire value is staying small and deterministic. If you want semantics and clever prompting, that's the plug-in point.
167
+ That boundary is the correct seam. Judging whether a piece of evidence is actually meaningful is a semantic question, and semantic questions need prompting, an LLM judge, or domain logic to answer. That work belongs outside `fpf`, at the evidence-wiring layer, not inside a library whose value comes from staying small and deterministic. If a project needs richer semantics, add them at that integration point.
168
168
 
169
169
  **This is also why Memory-Augmented Generation (MAG) is rejected as fpf's own architecture, deliberately and permanently.** MAG — retrieval, embeddings, cross-session recall — solves a different problem (what did we discuss three sessions ago) than fpf solves (is this move lawful right now), and it needs exactly the dependency profile this library rules out by design. That is a scope boundary, not a verdict on MAG as a technique: a MAG system is a legitimate thing to run *upstream* of fpf. Whatever it retrieves becomes an evidence_id in `RuntimeBinding.current_evidence` like any other — fpf doesn't care how evidence was produced, only whether it's present, fresh, and licensed. Memory belongs at the evidence-wiring layer, alongside every other semantic judgment this library deliberately doesn't make.
170
170
 
@@ -181,7 +181,7 @@ The core advantage is not "more theory." It is less runtime burden.
181
181
 
182
182
  Without a compiled map, the model keeps re-addressing its own run: am I allowed to move, did I already satisfy the gate, am I missing evidence, am I in the wrong context, am I done or blocked? That self-management loop is where a lot of bad agent behavior comes from.
183
183
 
184
- This package turns that loop into a small stateful instrument panel. The model sees what can fire, what cannot, and why. That is enough of an operating surface for many practical agent tasks. Not a panacea, not a grand theory of intelligence, just enough window and file-handles for the model to open the right thing without smashing the house.
184
+ This package turns that loop into a small stateful instrument panel. The model sees what can fire, what cannot, and why. That is enough of an operating surface for many practical agent tasks: not a grand theory of intelligence, just a narrow surface that helps the model choose the next lawful move.
185
185
 
186
186
  The bottleneck was never raw model capability — it's self-management overhead eating the capability that's already there. Most orgs running these models, at any scale, hit that ceiling: infra and process that never actually asked the model for full capacity, so upgrading the model changes nothing. This library doesn't make the model smarter. It shrinks what the model has to hold in its head at any one step, so whatever capability is actually there gets spent on the real problem instead of on self-management overhead.
187
187
 
@@ -215,7 +215,7 @@ The model's job shrinks from "figure out the entire epistemic state of your own
215
215
 
216
216
  - **Bridge crossing is enforced, not just advertised** — `ActiveState.cross_bridge()` / `ThinkingMapTraversal.attempt_bridge()` actually perform a cross-context hop and check `substitution_license` against `risk_level` before mutating state. An unlicensed bridge under `high`/`critical` risk is refused (`ESCALATE`), not silently allowed. Before this, `bridge_options()` was advisory metadata only — the model decided for itself whether a lossy translation was acceptable.
217
217
  - **`include_full_state=False`** — `step()` can now ship the scoped `slice()` alone, without the whole board bolted on. Default stays `True`; opt in when the caller already knows its `transition_id` and wants the lean payload.
218
- - 21/21 self-verification checks (`python -m fpf_thinking_map.verify`), two new: bridge crossing and lean-slice payload shape.
218
+ - 21/21 self-verification checks at release time (`python -m fpf_thinking_map.verify`), two new: bridge crossing and lean-slice payload shape.
219
219
 
220
220
  ## v1.4.0 changes
221
221
 
@@ -313,7 +313,7 @@ Built with Claude Code (Anthropic claude-sonnet-4-6). Tested and verified to wor
313
313
  | **OpenAI GPT** (GPT-4o, o1, o3) | Works | Used for the 50-item source-to-code relation audit. Reads the primitives, logic rules, and prompt state correctly. |
314
314
  | **Any model that reads JSON and follows structured constraints** | Should work | The package outputs plain dicts. No model-specific prompting. |
315
315
 
316
- This is not a compliance seal. It means: we used these models against this package and they produced correct, usable results. The per-move slice is small enough for mid-tier models. The logic and guard outputs are plain JSON no special tokenization or prompt format required.
316
+ This is not a compliance certification. It means the package was exercised against these model families in this repo and produced correct, usable results. The per-move slice is small enough for mid-tier models. The logic and guard outputs are plain JSON, with no model-specific prompt format required.
317
317
 
318
318
  ## Why release this
319
319
 
@@ -321,8 +321,8 @@ We release this because it is useful beyond our own stack.
321
321
 
322
322
  - It captures a practical subset of FPF in a form models can actually use.
323
323
  - It gives agent builders a small constraint surface instead of another giant AI framework.
324
- - It helps turn model failure from mystical drift into inspectable state.
325
- - It stays intentionally narrow, so it can remain legible instead of becoming another overbuilt "agent platform."
324
+ - It helps turn model failure from opaque drift into inspectable state.
325
+ - It stays intentionally narrow so the package remains legible and easy to audit.
326
326
 
327
327
  ## Credits
328
328
 
@@ -8,9 +8,9 @@ A Python package that gives a model a bounded move board instead of a giant fram
8
8
 
9
9
  ## Why this exists
10
10
 
11
- FPF is valuable, but it is large, clumsy at runtime, and poorly shaped for direct model consumption. A human can read a 51k-line framework, understand its distinctions, and apply them carefully. A model usually does something else: it absorbs the vocabulary, performs the tone of the framework, and still drifts on the actual task.
11
+ FPF is valuable, but it is large at runtime and not well shaped for direct model consumption. A human can read a 51k-line framework, understand its distinctions, and apply them carefully. A model often does something narrower: it absorbs the vocabulary, mirrors the posture of rigor, and still drifts on the actual task.
12
12
 
13
- This package exists because the useful part is not making the model sound more scientific. The useful part is compiling the parts of FPF that help operational decisions into something small, explicit, and inspectable. We took what mattered for bounded traversal, left out what would bloat or bias the model, and evolved the result as publishers of a practical library rather than trying to reproduce the whole upstream framework inside another AI mega-system.
13
+ This package exists because the useful part is not making the model sound more scientific. The useful part is compiling the parts of FPF that help operational decisions into something small, explicit, and inspectable. We kept the parts that matter for bounded traversal, left out parts that would bloat or bias the model, and published the result as a practical library rather than as a reproduction of the full upstream framework.
14
14
 
15
15
  The goal is simple: give the model enough structure to behave understandably, without building a cage so elaborate that it becomes another source of drift.
16
16
 
@@ -27,7 +27,7 @@ In practice this does two useful things:
27
27
  - it reduces unexplained drift by moving state tracking and hard checks out of freeform model reasoning
28
28
  - it gives the model simple, understandable outcomes such as `CONTINUE`, `COLLECT_EVIDENCE`, `BRIDGE`, `IDLE`, `ESCALATE`, instead of making it reconstruct its own epistemic condition from scratch
29
29
 
30
- This is not a panacea. Models still miss information. They still drift. But with a bounded traversal map, the failure mode becomes much easier to explain: missing evidence, wrong context, blocked move, stale basis, unlicensed bridge. The weirdness gets smaller because the state is smaller.
30
+ This is not a panacea. Models still miss information. They still drift. With a bounded traversal map, however, the failure mode becomes easier to explain: missing evidence, wrong context, blocked move, stale basis, unlicensed bridge. The state is smaller, so the failure surface is easier to inspect.
31
31
 
32
32
  ## Provable practical gains
33
33
 
@@ -39,7 +39,7 @@ The improvements here are intentionally simple and operational:
39
39
  - smaller runtime payload, because the model gets a slice, not a corpus
40
40
  - easier debugging, because outcomes are discrete and inspectable
41
41
 
42
- That is the whole point: practical gain, not intellectual theater.
42
+ That is the whole point: practical gain, stated plainly and checked in code.
43
43
 
44
44
  ## Quick start
45
45
 
@@ -79,7 +79,7 @@ fpf_thinking_map/
79
79
 
80
80
  `verify.py` proves the engine's own logic is internally consistent. It doesn't prove the compiled map covers the breadth of the original FPF spec — `examples.py` has one domain, five scenarios. `dev_mcp/` is an MCP server for constructing scenarios ad hoc and driving them against the documents that already ground FPF semantics in this repo: `SOURCES.md` (which spec section each primitive is supposed to enforce), `FPF_SOURCE_TO_CODE_RELATION_AUDIT.md` (a cited 50-item gap backlog), and `ADVISORIES.md` (deliberate-minimalism findings for integrators — not defects, but real defaults you should know about before assuming they match your domain).
81
81
 
82
- Not shipped in the package — `pyproject.toml` only builds `fpf_thinking_map*`, so this stays a repo-only dev tool by construction, for whoever's interested enough to dig past `pip install`. `run_scenario` requires a `scope`: `"core"` for testing this library's own shipped primitives (our responsibility, our tracking), `"user-extension"` for testing a domain map built on top (your responsibility, your repo). Full docs, install steps, self-test, worked example: [dev_mcp/README.md](dev_mcp/README.md).
82
+ Not shipped in the package — `pyproject.toml` only builds `fpf_thinking_map*`, so this stays a repo-only development tool by construction. `run_scenario` requires a `scope`: `"core"` for testing this library's own shipped primitives (publisher tracking in this repo), `"user-extension"` for testing a domain map built on top (consumer tracking in the integrating repo). Full docs, install steps, self-test, and a worked example are in [dev_mcp/README.md](dev_mcp/README.md).
83
83
 
84
84
  ## Relationship to ailev/FPF
85
85
 
@@ -138,7 +138,7 @@ fpf does not ship better reasoning. It ships **inspectability**: did the agent f
138
138
 
139
139
  Take the stagnation counter as the concrete case. It bounds repetition — but only if the integration maps one real attempt to one `step()` call, and only adds evidence when something genuinely new was found. Whether that actually catches a real LLM thrashing depends entirely on whether the calling harness wires evidence honestly, not just "a tool returned something." That wiring discipline lives outside this library, in whatever integrates it — an agent loop, an MCP server, application code. fpf can't verify that discipline was followed; it can only guarantee that if it was, repetition is bounded.
140
140
 
141
- That boundary is the correct seam, not a gap to apologize for. Judging whether a piece of evidence is actually meaningful is a semantic question, and semantic questions need prompting, an LLM judge, or domain logic to answer which is exactly where that belongs: outside fpf, at the evidence-wiring layer, not folded into a library whose entire value is staying small and deterministic. If you want semantics and clever prompting, that's the plug-in point.
141
+ That boundary is the correct seam. Judging whether a piece of evidence is actually meaningful is a semantic question, and semantic questions need prompting, an LLM judge, or domain logic to answer. That work belongs outside `fpf`, at the evidence-wiring layer, not inside a library whose value comes from staying small and deterministic. If a project needs richer semantics, add them at that integration point.
142
142
 
143
143
  **This is also why Memory-Augmented Generation (MAG) is rejected as fpf's own architecture, deliberately and permanently.** MAG — retrieval, embeddings, cross-session recall — solves a different problem (what did we discuss three sessions ago) than fpf solves (is this move lawful right now), and it needs exactly the dependency profile this library rules out by design. That is a scope boundary, not a verdict on MAG as a technique: a MAG system is a legitimate thing to run *upstream* of fpf. Whatever it retrieves becomes an evidence_id in `RuntimeBinding.current_evidence` like any other — fpf doesn't care how evidence was produced, only whether it's present, fresh, and licensed. Memory belongs at the evidence-wiring layer, alongside every other semantic judgment this library deliberately doesn't make.
144
144
 
@@ -155,7 +155,7 @@ The core advantage is not "more theory." It is less runtime burden.
155
155
 
156
156
  Without a compiled map, the model keeps re-addressing its own run: am I allowed to move, did I already satisfy the gate, am I missing evidence, am I in the wrong context, am I done or blocked? That self-management loop is where a lot of bad agent behavior comes from.
157
157
 
158
- This package turns that loop into a small stateful instrument panel. The model sees what can fire, what cannot, and why. That is enough of an operating surface for many practical agent tasks. Not a panacea, not a grand theory of intelligence, just enough window and file-handles for the model to open the right thing without smashing the house.
158
+ This package turns that loop into a small stateful instrument panel. The model sees what can fire, what cannot, and why. That is enough of an operating surface for many practical agent tasks: not a grand theory of intelligence, just a narrow surface that helps the model choose the next lawful move.
159
159
 
160
160
  The bottleneck was never raw model capability — it's self-management overhead eating the capability that's already there. Most orgs running these models, at any scale, hit that ceiling: infra and process that never actually asked the model for full capacity, so upgrading the model changes nothing. This library doesn't make the model smarter. It shrinks what the model has to hold in its head at any one step, so whatever capability is actually there gets spent on the real problem instead of on self-management overhead.
161
161
 
@@ -189,7 +189,7 @@ The model's job shrinks from "figure out the entire epistemic state of your own
189
189
 
190
190
  - **Bridge crossing is enforced, not just advertised** — `ActiveState.cross_bridge()` / `ThinkingMapTraversal.attempt_bridge()` actually perform a cross-context hop and check `substitution_license` against `risk_level` before mutating state. An unlicensed bridge under `high`/`critical` risk is refused (`ESCALATE`), not silently allowed. Before this, `bridge_options()` was advisory metadata only — the model decided for itself whether a lossy translation was acceptable.
191
191
  - **`include_full_state=False`** — `step()` can now ship the scoped `slice()` alone, without the whole board bolted on. Default stays `True`; opt in when the caller already knows its `transition_id` and wants the lean payload.
192
- - 21/21 self-verification checks (`python -m fpf_thinking_map.verify`), two new: bridge crossing and lean-slice payload shape.
192
+ - 21/21 self-verification checks at release time (`python -m fpf_thinking_map.verify`), two new: bridge crossing and lean-slice payload shape.
193
193
 
194
194
  ## v1.4.0 changes
195
195
 
@@ -287,7 +287,7 @@ Built with Claude Code (Anthropic claude-sonnet-4-6). Tested and verified to wor
287
287
  | **OpenAI GPT** (GPT-4o, o1, o3) | Works | Used for the 50-item source-to-code relation audit. Reads the primitives, logic rules, and prompt state correctly. |
288
288
  | **Any model that reads JSON and follows structured constraints** | Should work | The package outputs plain dicts. No model-specific prompting. |
289
289
 
290
- This is not a compliance seal. It means: we used these models against this package and they produced correct, usable results. The per-move slice is small enough for mid-tier models. The logic and guard outputs are plain JSON no special tokenization or prompt format required.
290
+ This is not a compliance certification. It means the package was exercised against these model families in this repo and produced correct, usable results. The per-move slice is small enough for mid-tier models. The logic and guard outputs are plain JSON, with no model-specific prompt format required.
291
291
 
292
292
  ## Why release this
293
293
 
@@ -295,8 +295,8 @@ We release this because it is useful beyond our own stack.
295
295
 
296
296
  - It captures a practical subset of FPF in a form models can actually use.
297
297
  - It gives agent builders a small constraint surface instead of another giant AI framework.
298
- - It helps turn model failure from mystical drift into inspectable state.
299
- - It stays intentionally narrow, so it can remain legible instead of becoming another overbuilt "agent platform."
298
+ - It helps turn model failure from opaque drift into inspectable state.
299
+ - It stays intentionally narrow so the package remains legible and easy to audit.
300
300
 
301
301
  ## Credits
302
302
 
@@ -1,6 +1,6 @@
1
1
  # FPF Thinking Map
2
2
 
3
- This folder contains a Python package that helps an AI model make bounded decisions step by step. It combines a compiled subset of FPF with basic logic operations from computer science so the model can read a small move board instead of digesting a giant framework at runtime.
3
+ This folder contains a Python package that helps an AI model make bounded decisions step by step. It combines a compiled subset of FPF with basic logic operations from computer science so the model can read a small move board instead of digesting a large framework at runtime.
4
4
 
5
5
  No external dependencies. Pure Python 3.12+. No pip install needed.
6
6
 
@@ -15,11 +15,11 @@ This package gives the model a small, structured board to reason on. The board h
15
15
 
16
16
  The model reads the board, then picks from a fixed set of moves: continue, ask, abstain, escalate, collect evidence, etc.
17
17
 
18
- The point is not to make the model "more intelligent." The point is to make its behavior smaller, more understandable, and less likely to drift for stupid reasons.
18
+ The point is not to make the model "more intelligent." The point is to make its behavior smaller, more understandable, and less likely to drift for ordinary, inspectable reasons.
19
19
 
20
20
  ## Why this package exists next to FPF
21
21
 
22
- FPF is strong material for humans, but too big and too clumsy to hand to a model raw and expect clean operational behavior. A model tends to absorb the vocabulary, imitate the posture of rigor, and still miss the simple thing it needed to do.
22
+ FPF is strong material for humans, but too large to hand to a model raw and expect clean operational behavior. A model tends to absorb the vocabulary, imitate the posture of rigor, and still miss the simple thing it needed to do.
23
23
 
24
24
  So we did not port the whole framework. We extracted what was useful for bounded traversal, made it executable, and left out the parts that would inflate runtime payload or trigger open-ended academic-pattern generation. This package is not "FPF but more." It is "the part of FPF that helps agents behave better, compiled into something they can actually use."
25
25
 
@@ -50,7 +50,7 @@ fpf_thinking_map/
50
50
  ├── guards.py 9 deterministic guards the model cannot break
51
51
  ├── logic.py 6 logic operators + EvidenceFresh + decision rules
52
52
  ├── traversal.py Step engine with 10 lawful outcomes (incl. IDLE, BRIDGE)
53
- ├── verify.py Self-test: run it, if 21/21 pass, package works
53
+ ├── verify.py Self-test: run it, if 22/22 pass, package works
54
54
 
55
55
  ├── examples.py 5 deploy decision scenarios (all features in action)
56
56
 
@@ -264,7 +264,7 @@ outcome = engine.step(state, transition_id="start_to_reviewed")
264
264
  - Not a replacement for the full FPF spec
265
265
  - Not a symbolic AI / expert system (the LLM interprets; logic + guards constrain)
266
266
  - Not a framework to build on top of — it is a small self-contained package
267
- - Not a panacea for agent drift; it reduces and explains drift, it does not eliminate it
267
+ - Not a panacea for agent drift; it reduces and explains drift, but it does not eliminate it
268
268
 
269
269
  ## Known design decisions
270
270
 
@@ -272,4 +272,4 @@ outcome = engine.step(state, transition_id="start_to_reviewed")
272
272
  - `demo_walk()` auto-fires the first available transition. It is for testing and examples only, not for operational use. In real use, the LLM calls `step()` and `attempt_transition()` with explicit choices.
273
273
  - Publications are registered on the map but stay out of the step/guard/logic path. They are for publish-type moves only.
274
274
 
275
- prichindel.com | 2026-06-26 | v1.1.2
275
+ prichindel.com | 2026-07-08 | v1.4.3
@@ -70,4 +70,4 @@ We applied the same pattern:
70
70
  - **Adaptation**: prichindel.com
71
71
  - **Created**: 2026-06-24
72
72
  - **Purpose**: Semi-encode FPF into an agentic thinking map with propositional logic glue
73
- - **Repository**: [github.com/igareosh/prichindel.com-agentic-thinking-map](https://github.com/igareosh/prichindel.com-agentic-thinking-map)
73
+ - **Repository**: [github.com/igareosh/fpf-agentic-thinking-map](https://github.com/igareosh/fpf-agentic-thinking-map)
@@ -1,13 +1,13 @@
1
1
  Metadata-Version: 2.4
2
2
  Name: fpf-thinking-map
3
- Version: 1.4.3
4
- Summary: Agentic thinking map structured reasoning constraints for LLMs with TTL evidence decay, deterministic guards, and propositional logic glue. Compiled from FPF (First Principles Framework).
3
+ Version: 1.4.4
4
+ Summary: Agentic thinking map for bounded LLM traversal, with TTL evidence decay, deterministic guards, and propositional logic. Compiled from FPF (First Principles Framework).
5
5
  Author-email: "prichindel.com" <igareosh@igareosh.com>
6
6
  License-Expression: MIT
7
- Project-URL: Homepage, https://github.com/igareosh/prichindel.com-agentic-thinking-map
8
- Project-URL: Repository, https://github.com/igareosh/prichindel.com-agentic-thinking-map
9
- Project-URL: Documentation, https://github.com/igareosh/prichindel.com-agentic-thinking-map#readme
10
- Project-URL: Issues, https://github.com/igareosh/prichindel.com-agentic-thinking-map/issues
7
+ Project-URL: Homepage, https://github.com/igareosh/fpf-agentic-thinking-map
8
+ Project-URL: Repository, https://github.com/igareosh/fpf-agentic-thinking-map
9
+ Project-URL: Documentation, https://github.com/igareosh/fpf-agentic-thinking-map#readme
10
+ Project-URL: Issues, https://github.com/igareosh/fpf-agentic-thinking-map/issues
11
11
  Keywords: agentic,thinking-map,llm,reasoning,propositional-logic,evidence-decay,ttl,guards,gates,semantic-map,fpf
12
12
  Classifier: Development Status :: 4 - Beta
13
13
  Classifier: Intended Audience :: Developers
@@ -34,9 +34,9 @@ A Python package that gives a model a bounded move board instead of a giant fram
34
34
 
35
35
  ## Why this exists
36
36
 
37
- FPF is valuable, but it is large, clumsy at runtime, and poorly shaped for direct model consumption. A human can read a 51k-line framework, understand its distinctions, and apply them carefully. A model usually does something else: it absorbs the vocabulary, performs the tone of the framework, and still drifts on the actual task.
37
+ FPF is valuable, but it is large at runtime and not well shaped for direct model consumption. A human can read a 51k-line framework, understand its distinctions, and apply them carefully. A model often does something narrower: it absorbs the vocabulary, mirrors the posture of rigor, and still drifts on the actual task.
38
38
 
39
- This package exists because the useful part is not making the model sound more scientific. The useful part is compiling the parts of FPF that help operational decisions into something small, explicit, and inspectable. We took what mattered for bounded traversal, left out what would bloat or bias the model, and evolved the result as publishers of a practical library rather than trying to reproduce the whole upstream framework inside another AI mega-system.
39
+ This package exists because the useful part is not making the model sound more scientific. The useful part is compiling the parts of FPF that help operational decisions into something small, explicit, and inspectable. We kept the parts that matter for bounded traversal, left out parts that would bloat or bias the model, and published the result as a practical library rather than as a reproduction of the full upstream framework.
40
40
 
41
41
  The goal is simple: give the model enough structure to behave understandably, without building a cage so elaborate that it becomes another source of drift.
42
42
 
@@ -53,7 +53,7 @@ In practice this does two useful things:
53
53
  - it reduces unexplained drift by moving state tracking and hard checks out of freeform model reasoning
54
54
  - it gives the model simple, understandable outcomes such as `CONTINUE`, `COLLECT_EVIDENCE`, `BRIDGE`, `IDLE`, `ESCALATE`, instead of making it reconstruct its own epistemic condition from scratch
55
55
 
56
- This is not a panacea. Models still miss information. They still drift. But with a bounded traversal map, the failure mode becomes much easier to explain: missing evidence, wrong context, blocked move, stale basis, unlicensed bridge. The weirdness gets smaller because the state is smaller.
56
+ This is not a panacea. Models still miss information. They still drift. With a bounded traversal map, however, the failure mode becomes easier to explain: missing evidence, wrong context, blocked move, stale basis, unlicensed bridge. The state is smaller, so the failure surface is easier to inspect.
57
57
 
58
58
  ## Provable practical gains
59
59
 
@@ -65,7 +65,7 @@ The improvements here are intentionally simple and operational:
65
65
  - smaller runtime payload, because the model gets a slice, not a corpus
66
66
  - easier debugging, because outcomes are discrete and inspectable
67
67
 
68
- That is the whole point: practical gain, not intellectual theater.
68
+ That is the whole point: practical gain, stated plainly and checked in code.
69
69
 
70
70
  ## Quick start
71
71
 
@@ -105,7 +105,7 @@ fpf_thinking_map/
105
105
 
106
106
  `verify.py` proves the engine's own logic is internally consistent. It doesn't prove the compiled map covers the breadth of the original FPF spec — `examples.py` has one domain, five scenarios. `dev_mcp/` is an MCP server for constructing scenarios ad hoc and driving them against the documents that already ground FPF semantics in this repo: `SOURCES.md` (which spec section each primitive is supposed to enforce), `FPF_SOURCE_TO_CODE_RELATION_AUDIT.md` (a cited 50-item gap backlog), and `ADVISORIES.md` (deliberate-minimalism findings for integrators — not defects, but real defaults you should know about before assuming they match your domain).
107
107
 
108
- Not shipped in the package — `pyproject.toml` only builds `fpf_thinking_map*`, so this stays a repo-only dev tool by construction, for whoever's interested enough to dig past `pip install`. `run_scenario` requires a `scope`: `"core"` for testing this library's own shipped primitives (our responsibility, our tracking), `"user-extension"` for testing a domain map built on top (your responsibility, your repo). Full docs, install steps, self-test, worked example: [dev_mcp/README.md](dev_mcp/README.md).
108
+ Not shipped in the package — `pyproject.toml` only builds `fpf_thinking_map*`, so this stays a repo-only development tool by construction. `run_scenario` requires a `scope`: `"core"` for testing this library's own shipped primitives (publisher tracking in this repo), `"user-extension"` for testing a domain map built on top (consumer tracking in the integrating repo). Full docs, install steps, self-test, and a worked example are in [dev_mcp/README.md](dev_mcp/README.md).
109
109
 
110
110
  ## Relationship to ailev/FPF
111
111
 
@@ -164,7 +164,7 @@ fpf does not ship better reasoning. It ships **inspectability**: did the agent f
164
164
 
165
165
  Take the stagnation counter as the concrete case. It bounds repetition — but only if the integration maps one real attempt to one `step()` call, and only adds evidence when something genuinely new was found. Whether that actually catches a real LLM thrashing depends entirely on whether the calling harness wires evidence honestly, not just "a tool returned something." That wiring discipline lives outside this library, in whatever integrates it — an agent loop, an MCP server, application code. fpf can't verify that discipline was followed; it can only guarantee that if it was, repetition is bounded.
166
166
 
167
- That boundary is the correct seam, not a gap to apologize for. Judging whether a piece of evidence is actually meaningful is a semantic question, and semantic questions need prompting, an LLM judge, or domain logic to answer which is exactly where that belongs: outside fpf, at the evidence-wiring layer, not folded into a library whose entire value is staying small and deterministic. If you want semantics and clever prompting, that's the plug-in point.
167
+ That boundary is the correct seam. Judging whether a piece of evidence is actually meaningful is a semantic question, and semantic questions need prompting, an LLM judge, or domain logic to answer. That work belongs outside `fpf`, at the evidence-wiring layer, not inside a library whose value comes from staying small and deterministic. If a project needs richer semantics, add them at that integration point.
168
168
 
169
169
  **This is also why Memory-Augmented Generation (MAG) is rejected as fpf's own architecture, deliberately and permanently.** MAG — retrieval, embeddings, cross-session recall — solves a different problem (what did we discuss three sessions ago) than fpf solves (is this move lawful right now), and it needs exactly the dependency profile this library rules out by design. That is a scope boundary, not a verdict on MAG as a technique: a MAG system is a legitimate thing to run *upstream* of fpf. Whatever it retrieves becomes an evidence_id in `RuntimeBinding.current_evidence` like any other — fpf doesn't care how evidence was produced, only whether it's present, fresh, and licensed. Memory belongs at the evidence-wiring layer, alongside every other semantic judgment this library deliberately doesn't make.
170
170
 
@@ -181,7 +181,7 @@ The core advantage is not "more theory." It is less runtime burden.
181
181
 
182
182
  Without a compiled map, the model keeps re-addressing its own run: am I allowed to move, did I already satisfy the gate, am I missing evidence, am I in the wrong context, am I done or blocked? That self-management loop is where a lot of bad agent behavior comes from.
183
183
 
184
- This package turns that loop into a small stateful instrument panel. The model sees what can fire, what cannot, and why. That is enough of an operating surface for many practical agent tasks. Not a panacea, not a grand theory of intelligence, just enough window and file-handles for the model to open the right thing without smashing the house.
184
+ This package turns that loop into a small stateful instrument panel. The model sees what can fire, what cannot, and why. That is enough of an operating surface for many practical agent tasks: not a grand theory of intelligence, just a narrow surface that helps the model choose the next lawful move.
185
185
 
186
186
  The bottleneck was never raw model capability — it's self-management overhead eating the capability that's already there. Most orgs running these models, at any scale, hit that ceiling: infra and process that never actually asked the model for full capacity, so upgrading the model changes nothing. This library doesn't make the model smarter. It shrinks what the model has to hold in its head at any one step, so whatever capability is actually there gets spent on the real problem instead of on self-management overhead.
187
187
 
@@ -215,7 +215,7 @@ The model's job shrinks from "figure out the entire epistemic state of your own
215
215
 
216
216
  - **Bridge crossing is enforced, not just advertised** — `ActiveState.cross_bridge()` / `ThinkingMapTraversal.attempt_bridge()` actually perform a cross-context hop and check `substitution_license` against `risk_level` before mutating state. An unlicensed bridge under `high`/`critical` risk is refused (`ESCALATE`), not silently allowed. Before this, `bridge_options()` was advisory metadata only — the model decided for itself whether a lossy translation was acceptable.
217
217
  - **`include_full_state=False`** — `step()` can now ship the scoped `slice()` alone, without the whole board bolted on. Default stays `True`; opt in when the caller already knows its `transition_id` and wants the lean payload.
218
- - 21/21 self-verification checks (`python -m fpf_thinking_map.verify`), two new: bridge crossing and lean-slice payload shape.
218
+ - 21/21 self-verification checks at release time (`python -m fpf_thinking_map.verify`), two new: bridge crossing and lean-slice payload shape.
219
219
 
220
220
  ## v1.4.0 changes
221
221
 
@@ -313,7 +313,7 @@ Built with Claude Code (Anthropic claude-sonnet-4-6). Tested and verified to wor
313
313
  | **OpenAI GPT** (GPT-4o, o1, o3) | Works | Used for the 50-item source-to-code relation audit. Reads the primitives, logic rules, and prompt state correctly. |
314
314
  | **Any model that reads JSON and follows structured constraints** | Should work | The package outputs plain dicts. No model-specific prompting. |
315
315
 
316
- This is not a compliance seal. It means: we used these models against this package and they produced correct, usable results. The per-move slice is small enough for mid-tier models. The logic and guard outputs are plain JSON no special tokenization or prompt format required.
316
+ This is not a compliance certification. It means the package was exercised against these model families in this repo and produced correct, usable results. The per-move slice is small enough for mid-tier models. The logic and guard outputs are plain JSON, with no model-specific prompt format required.
317
317
 
318
318
  ## Why release this
319
319
 
@@ -321,8 +321,8 @@ We release this because it is useful beyond our own stack.
321
321
 
322
322
  - It captures a practical subset of FPF in a form models can actually use.
323
323
  - It gives agent builders a small constraint surface instead of another giant AI framework.
324
- - It helps turn model failure from mystical drift into inspectable state.
325
- - It stays intentionally narrow, so it can remain legible instead of becoming another overbuilt "agent platform."
324
+ - It helps turn model failure from opaque drift into inspectable state.
325
+ - It stays intentionally narrow so the package remains legible and easy to audit.
326
326
 
327
327
  ## Credits
328
328
 
@@ -1,7 +1,7 @@
1
1
  [project]
2
2
  name = "fpf-thinking-map"
3
- version = "1.4.3"
4
- description = "Agentic thinking map structured reasoning constraints for LLMs with TTL evidence decay, deterministic guards, and propositional logic glue. Compiled from FPF (First Principles Framework)."
3
+ version = "1.4.4"
4
+ description = "Agentic thinking map for bounded LLM traversal, with TTL evidence decay, deterministic guards, and propositional logic. Compiled from FPF (First Principles Framework)."
5
5
  readme = "README.md"
6
6
  license = "MIT"
7
7
  requires-python = ">=3.12"
@@ -27,10 +27,10 @@ classifiers = [
27
27
  ]
28
28
 
29
29
  [project.urls]
30
- Homepage = "https://github.com/igareosh/prichindel.com-agentic-thinking-map"
31
- Repository = "https://github.com/igareosh/prichindel.com-agentic-thinking-map"
32
- Documentation = "https://github.com/igareosh/prichindel.com-agentic-thinking-map#readme"
33
- Issues = "https://github.com/igareosh/prichindel.com-agentic-thinking-map/issues"
30
+ Homepage = "https://github.com/igareosh/fpf-agentic-thinking-map"
31
+ Repository = "https://github.com/igareosh/fpf-agentic-thinking-map"
32
+ Documentation = "https://github.com/igareosh/fpf-agentic-thinking-map#readme"
33
+ Issues = "https://github.com/igareosh/fpf-agentic-thinking-map/issues"
34
34
 
35
35
  [build-system]
36
36
  requires = ["setuptools>=68.0"]