memahead 0.1.0__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.
@@ -0,0 +1,8 @@
1
+ # Copy to .env and fill in your values. .env is gitignored.
2
+ # Get a PyPI token: https://pypi.org/manage/account/token/
3
+
4
+ TWINE_USERNAME=__token__
5
+ TWINE_PASSWORD=pypi-your-token-here
6
+
7
+ # Optional: upload to TestPyPI first
8
+ # TWINE_REPOSITORY_URL=https://test.pypi.org/legacy/
@@ -0,0 +1,70 @@
1
+ # Byte-compiled / optimized / DLL files
2
+ __pycache__/
3
+ *.py[cod]
4
+ *$py.class
5
+
6
+ # C extensions
7
+ *.so
8
+
9
+ # Distribution / packaging
10
+ .Python
11
+ build/
12
+ develop-eggs/
13
+ dist/
14
+ downloads/
15
+ eggs/
16
+ .eggs/
17
+ lib/
18
+ lib64/
19
+ parts/
20
+ sdist/
21
+ var/
22
+ wheels/
23
+ share/python-wheels/
24
+ *.egg-info/
25
+ .installed.cfg
26
+ *.egg
27
+ MANIFEST
28
+
29
+ # Unit test / coverage reports
30
+ htmlcov/
31
+ .tox/
32
+ .nox/
33
+ .coverage
34
+ .coverage.*
35
+ .cache
36
+ nosetests.xml
37
+ coverage.xml
38
+ *.cover
39
+ *.py,cover
40
+ .hypothesis/
41
+ .pytest_cache/
42
+
43
+ # Environments
44
+ .env
45
+ .pypirc
46
+ .venv
47
+ env/
48
+ venv/
49
+ ENV/
50
+ env.bak/
51
+ venv.bak/
52
+
53
+ # Editors / IDEs
54
+ .idea/
55
+ .vscode/
56
+ *.swp
57
+ *.swo
58
+ .DS_Store
59
+
60
+ # Type checkers / linters
61
+ .mypy_cache/
62
+ .dmypy.json
63
+ dmypy.json
64
+ .ruff_cache/
65
+ .pyright/
66
+
67
+ # Model / embedding caches
68
+ .cache/
69
+ *.pt
70
+ *.bin
memahead-0.1.0/LICENSE ADDED
@@ -0,0 +1,201 @@
1
+ Apache License
2
+ Version 2.0, January 2004
3
+ http://www.apache.org/licenses/
4
+
5
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
6
+
7
+ 1. Definitions.
8
+
9
+ "License" shall mean the terms and conditions for use, reproduction,
10
+ and distribution as defined by Sections 1 through 9 of this document.
11
+
12
+ "Licensor" shall mean the copyright owner or entity authorized by
13
+ the copyright owner that is granting the License.
14
+
15
+ "Legal Entity" shall mean the union of the acting entity and all
16
+ other entities that control, are controlled by, or are under common
17
+ control with that entity. For the purposes of this definition,
18
+ "control" means (i) the power, direct or indirect, to cause the
19
+ direction or management of such entity, whether by contract or
20
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
21
+ outstanding shares, or (iii) beneficial ownership of such entity.
22
+
23
+ "You" (or "Your") shall mean an individual or Legal Entity
24
+ exercising permissions granted by this License.
25
+
26
+ "Source" form shall mean the preferred form for making modifications,
27
+ including but not limited to software source code, documentation
28
+ source, and configuration files.
29
+
30
+ "Object" form shall mean any form resulting from mechanical
31
+ transformation or translation of a Source form, including but
32
+ not limited to compiled object code, generated documentation,
33
+ and conversions to other media types.
34
+
35
+ "Work" shall mean the work of authorship, whether in Source or
36
+ Object form, made available under the License, as indicated by a
37
+ copyright notice that is included in or attached to the work
38
+ (an example is provided in the Appendix below).
39
+
40
+ "Derivative Works" shall mean any work, whether in Source or Object
41
+ form, that is based on (or derived from) the Work and for which the
42
+ editorial revisions, annotations, elaborations, or other modifications
43
+ represent, as a whole, an original work of authorship. For the purposes
44
+ of this License, Derivative Works shall not include works that remain
45
+ separable from, or merely link (or bind by name) to the interfaces of,
46
+ the Work and Derivative Works thereof.
47
+
48
+ "Contribution" shall mean any work of authorship, including
49
+ the original version of the Work and any modifications or additions
50
+ to that Work or Derivative Works thereof, that is intentionally
51
+ submitted to Licensor for inclusion in the Work by the copyright owner
52
+ or by an individual or Legal Entity authorized to submit on behalf of
53
+ the copyright owner. For the purposes of this definition, "submitted"
54
+ means any form of electronic, verbal, or written communication sent
55
+ to the Licensor or its representatives, including but not limited to
56
+ communication on electronic mailing lists, source code control systems,
57
+ and issue tracking systems that are managed by, or on behalf of, the
58
+ Licensor for the purpose of discussing and improving the Work, but
59
+ excluding communication that is conspicuously marked or otherwise
60
+ designated in writing by the copyright owner as "Not a Contribution."
61
+
62
+ "Contributor" shall mean Licensor and any individual or Legal Entity
63
+ on behalf of whom a Contribution has been received by Licensor and
64
+ subsequently incorporated within the Work.
65
+
66
+ 2. Grant of Copyright License. Subject to the terms and conditions of
67
+ this License, each Contributor hereby grants to You a perpetual,
68
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
69
+ copyright license to reproduce, prepare Derivative Works of,
70
+ publicly display, publicly perform, sublicense, and distribute the
71
+ Work and such Derivative Works in Source or Object form.
72
+
73
+ 3. Grant of Patent License. Subject to the terms and conditions of
74
+ this License, each Contributor hereby grants to You a perpetual,
75
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
76
+ (except as stated in this section) patent license to make, have made,
77
+ use, offer to sell, sell, import, and otherwise transfer the Work,
78
+ where such license applies only to those patent claims licensable
79
+ by such Contributor that are necessarily infringed by their
80
+ Contribution(s) alone or by combination of their Contribution(s)
81
+ with the Work to which such Contribution(s) was submitted. If You
82
+ institute patent litigation against any entity (including a
83
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
84
+ or a Contribution incorporated within the Work constitutes direct
85
+ or contributory patent infringement, then any patent licenses
86
+ granted to You under this License for that Work shall terminate
87
+ as of the date such litigation is filed.
88
+
89
+ 4. Redistribution. You may reproduce and distribute copies of the
90
+ Work or Derivative Works thereof in any medium, with or without
91
+ modifications, and in Source or Object form, provided that You
92
+ meet the following conditions:
93
+
94
+ (a) You must give any other recipients of the Work or Derivative
95
+ Works a copy of this License; and
96
+
97
+ (b) You must cause any modified files to carry prominent notices
98
+ stating that You changed the files; and
99
+
100
+ (c) You must retain, in the Source form of any Derivative Works
101
+ that You distribute, all copyright, patent, trademark, and
102
+ attribution notices from the Source form of the Work,
103
+ excluding those notices that do not pertain to any part of
104
+ the Derivative Works; and
105
+
106
+ (d) If the Work includes a "NOTICE" text file as part of its
107
+ distribution, then any Derivative Works that You distribute must
108
+ include a readable copy of the attribution notices contained
109
+ within such NOTICE file, excluding those notices that do not
110
+ pertain to any part of the Derivative Works, in at least one
111
+ of the following places: within a NOTICE text file distributed
112
+ as part of the Derivative Works; within the Source form or
113
+ documentation, if provided along with the Derivative Works; or,
114
+ within a display generated by the Derivative Works, if and
115
+ wherever such third-party notices normally appear. The contents
116
+ of the NOTICE file are for informational purposes only and
117
+ do not modify the License. You may add Your own attribution
118
+ notices within Derivative Works that You distribute, alongside
119
+ or as an addendum to the NOTICE text from the Work, provided
120
+ that such additional attribution notices cannot be construed
121
+ as modifying the License.
122
+
123
+ You may add Your own copyright statement to Your modifications and
124
+ may provide additional or different license terms and conditions
125
+ for use, reproduction, or distribution of Your modifications, or
126
+ for any such Derivative Works as a whole, provided Your use,
127
+ reproduction, and distribution of the Work otherwise complies with
128
+ the conditions stated in this License.
129
+
130
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
131
+ any Contribution intentionally submitted for inclusion in the Work
132
+ by You to the Licensor shall be under the terms and conditions of
133
+ this License, without any additional terms or conditions.
134
+ Notwithstanding the above, nothing herein shall supersede or modify
135
+ the terms of any separate license agreement you may have executed
136
+ with Licensor regarding such Contributions.
137
+
138
+ 6. Trademarks. This License does not grant permission to use the trade
139
+ names, trademarks, service marks, or product names of the Licensor,
140
+ except as required for reasonable and customary use in describing the
141
+ origin of the Work and reproducing the content of the NOTICE file.
142
+
143
+ 7. Disclaimer of Warranty. Unless required by applicable law or
144
+ agreed to in writing, Licensor provides the Work (and each
145
+ Contributor provides its Contributions) on an "AS IS" BASIS,
146
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
147
+ implied, including, without limitation, any warranties or conditions
148
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
149
+ PARTICULAR PURPOSE. You are solely responsible for determining the
150
+ appropriateness of using or redistributing the Work and assume any
151
+ risks associated with Your exercise of permissions under this License.
152
+
153
+ 8. Limitation of Liability. In no event and under no legal theory,
154
+ whether in tort (including negligence), contract, or otherwise,
155
+ unless required by applicable law (such as deliberate and grossly
156
+ negligent acts) or agreed to in writing, shall any Contributor be
157
+ liable to You for damages, including any direct, indirect, special,
158
+ incidental, or consequential damages of any character arising as a
159
+ result of this License or out of the use or inability to use the
160
+ Work (including but not limited to damages for loss of goodwill,
161
+ work stoppage, computer failure or malfunction, or any and all
162
+ other commercial damages or losses), even if such Contributor
163
+ has been advised of the possibility of such damages.
164
+
165
+ 9. Accepting Warranty or Additional Liability. While redistributing
166
+ the Work or Derivative Works thereof, You may choose to offer,
167
+ and charge a fee for, acceptance of support, warranty, indemnity,
168
+ or other liability obligations and/or rights consistent with this
169
+ License. However, in accepting such obligations, You may act only
170
+ on Your own behalf and on Your sole responsibility, not on behalf
171
+ of any other Contributor, and only if You agree to indemnify,
172
+ defend, and hold each Contributor harmless for any liability
173
+ incurred by, or claims asserted against, such Contributor by reason
174
+ of your accepting any such warranty or additional liability.
175
+
176
+ END OF TERMS AND CONDITIONS
177
+
178
+ APPENDIX: How to apply the Apache License to your work.
179
+
180
+ To apply the Apache License to your work, attach the following
181
+ boilerplate notice, with the fields enclosed by brackets "[]"
182
+ replaced with your own identifying information. (Don't include
183
+ the brackets!) The text should be enclosed in the appropriate
184
+ comment syntax for the file format. We also recommend that a
185
+ file or class name and description of purpose be included on the
186
+ same "printed page" as the copyright notice for easier
187
+ identification within third-party archives.
188
+
189
+ Copyright 2026 memahead contributors
190
+
191
+ Licensed under the Apache License, Version 2.0 (the "License");
192
+ you may not use this file except in compliance with the License.
193
+ You may obtain a copy of the License at
194
+
195
+ http://www.apache.org/licenses/LICENSE-2.0
196
+
197
+ Unless required by applicable law or agreed to in writing, software
198
+ distributed under the License is distributed on an "AS IS" BASIS,
199
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
200
+ See the License for the specific language governing permissions and
201
+ limitations under the License.
memahead-0.1.0/NOTICE ADDED
@@ -0,0 +1,49 @@
1
+ memahead
2
+ Copyright 2026 memahead contributors
3
+
4
+ This product includes software developed by the memahead contributors,
5
+ licensed under the Apache License, Version 2.0.
6
+
7
+ ------------------------------------------------------------------------
8
+ Academic foundations
9
+ ------------------------------------------------------------------------
10
+
11
+ memahead productizes findings from the following research. memahead is an
12
+ independent implementation and is not affiliated with, endorsed by, or
13
+ released by the authors of these works. All credit for the underlying
14
+ ideas belongs to the respective authors.
15
+
16
+ 1. PAACE: Plan-Aware Agent Context Engineering
17
+ Yuksel et al., December 2025
18
+ arXiv:2512.16970
19
+ https://arxiv.org/abs/2512.16970
20
+
21
+ memahead's forward-looking retention scoring — scoring each context
22
+ chunk against the *remaining* steps of a plan rather than greedily
23
+ against past history — is inspired by the plan-aware compression
24
+ approach described in this paper.
25
+
26
+ 2. ACON: Agent Context Optimization
27
+ Kang et al., Microsoft, 2025
28
+ arXiv:2510.00615
29
+ https://arxiv.org/abs/2510.00615
30
+
31
+ memahead's chunk-level retention and tool-schema filtering draw on
32
+ the context optimization techniques described in this paper.
33
+
34
+ ------------------------------------------------------------------------
35
+ Third-party dependencies
36
+ ------------------------------------------------------------------------
37
+
38
+ memahead builds on top of, and gives full credit to:
39
+
40
+ - Headroom (headroom-ai), Apache-2.0
41
+ https://pypi.org/project/headroom-ai/
42
+ Headroom performs the underlying compression mechanics. memahead adds
43
+ a plan-aware retention scoring layer on top of it.
44
+
45
+ - sentence-transformers, Apache-2.0
46
+ https://www.sbert.net/
47
+
48
+ - NumPy, BSD-3-Clause
49
+ https://numpy.org/
@@ -0,0 +1,147 @@
1
+ Metadata-Version: 2.4
2
+ Name: memahead
3
+ Version: 0.1.0
4
+ Summary: Agent memory optimized for what's ahead: plan-aware, forward-looking context compression for LLM agents.
5
+ Project-URL: Homepage, https://github.com/memahead/memahead
6
+ Project-URL: Repository, https://github.com/memahead/memahead
7
+ Project-URL: Issues, https://github.com/memahead/memahead/issues
8
+ Author: memahead contributors
9
+ License: Apache-2.0
10
+ License-File: LICENSE
11
+ License-File: NOTICE
12
+ Keywords: agent,compression,context,headroom,llm,memory,plan,retention,tokens
13
+ Classifier: Development Status :: 3 - Alpha
14
+ Classifier: Intended Audience :: Developers
15
+ Classifier: License :: OSI Approved :: Apache Software License
16
+ Classifier: Programming Language :: Python :: 3
17
+ Classifier: Programming Language :: Python :: 3.10
18
+ Classifier: Programming Language :: Python :: 3.11
19
+ Classifier: Programming Language :: Python :: 3.12
20
+ Classifier: Topic :: Scientific/Engineering :: Artificial Intelligence
21
+ Requires-Python: >=3.10
22
+ Requires-Dist: headroom-ai>=0.5
23
+ Requires-Dist: numpy>=1.23
24
+ Requires-Dist: sentence-transformers>=2.2
25
+ Provides-Extra: dev
26
+ Requires-Dist: pytest>=7.0; extra == 'dev'
27
+ Requires-Dist: tiktoken>=0.5; extra == 'dev'
28
+ Provides-Extra: tokenizers
29
+ Requires-Dist: tiktoken>=0.5; extra == 'tokenizers'
30
+ Description-Content-Type: text/markdown
31
+
32
+ # memahead
33
+
34
+ **Agent memory optimized for what's ahead.**
35
+
36
+ memahead compresses an LLM agent's context at *each step* of a multi-step
37
+ workflow using forward-looking, plan-aware retention. Unlike tools that
38
+ compress greedily based on what already happened, memahead scores every chunk
39
+ of context against the **remaining steps in the plan** and drops what future
40
+ steps won't need — dramatically fewer tokens per agent call, without losing the
41
+ information that matters downstream.
42
+
43
+ memahead sits on top of [Headroom](https://pypi.org/project/headroom-ai/)
44
+ (`pip install headroom-ai`), which performs the underlying compression
45
+ mechanics. memahead adds the plan-aware retention scoring layer.
46
+
47
+ ## Install
48
+
49
+ ```bash
50
+ pip install memahead
51
+ ```
52
+
53
+ This pulls in `headroom-ai`, `sentence-transformers`, and `numpy`. For more
54
+ accurate token accounting, also install the optional extra:
55
+
56
+ ```bash
57
+ pip install "memahead[tokenizers]" # adds tiktoken
58
+ ```
59
+
60
+ ## Quick example
61
+
62
+ ```python
63
+ from memahead import Plan, Step, PlanAwareCompressor
64
+
65
+ plan = Plan([
66
+ Step("research", "Search and gather raw facts about the topic"),
67
+ Step("synthesize", "Identify key themes across the research"),
68
+ Step("draft", "Write a structured first draft"),
69
+ Step("revise", "Produce the final polished output"),
70
+ ])
71
+
72
+ compressor = PlanAwareCompressor(quality=0.85)
73
+
74
+ compressed = compressor.compress(
75
+ history=prior_messages, # your prior chat messages
76
+ tools=all_tool_schemas, # the full tool catalog
77
+ plan=plan,
78
+ current_step="synthesize", # the step about to run
79
+ )
80
+
81
+ response = llm.call(
82
+ messages=compressed.messages,
83
+ tools=compressed.tools,
84
+ )
85
+
86
+ print(compressed.report)
87
+ # TokenReport(before=12400, after=3100, saved=9300, compression_ratio=0.75)
88
+ ```
89
+
90
+ ## How it works
91
+
92
+ For the step about to run, memahead:
93
+
94
+ 1. **Splits** the conversation history into chunks (one per message).
95
+ 2. **Scores** each chunk against the *remaining* plan steps with a
96
+ `RetentionScorer` — embedding both with `all-MiniLM-L6-v2` and taking the
97
+ cosine similarity. A chunk is valuable if a future step is likely to need it.
98
+ 3. **Drops** chunks that future steps won't need (system messages and the
99
+ current turn's input are always retained).
100
+ 4. **Filters** the tool catalog down to schemas relevant to the current step —
101
+ deterministically, with no extra LLM call (`tool_filter`).
102
+ 5. **Hands** the survivors to Headroom for the actual mechanical compression.
103
+ 6. **Returns** a `CompressedContext` with lean `messages`, filtered `tools`,
104
+ and a `TokenReport` of exactly what was saved.
105
+
106
+ The `quality` dial (0.0–1.0) trades tokens for retention: higher keeps more
107
+ context, lower compresses more aggressively. Pass an explicit
108
+ `retention_threshold` for fully reproducible runs.
109
+
110
+ ## Public API
111
+
112
+ | Symbol | Purpose |
113
+ | --- | --- |
114
+ | `Step`, `Plan`, `PlanGraph` | Model linear or branching workflows; `plan.remaining_from(step)` is the forward horizon. |
115
+ | `RetentionScorer` | Forward-looking chunk scoring (the core novelty). |
116
+ | `ToolFilter`, `filter_tools` | Deterministic, LLM-free tool-schema filtering. |
117
+ | `PlanAwareCompressor` | The full pipeline. |
118
+ | `CompressedContext`, `TokenReport` | Results and savings accounting. |
119
+
120
+ The embedding backend is swappable: pass any callable
121
+ `list[str] -> np.ndarray` (or an object with `.encode`) as `embedder=` to
122
+ `RetentionScorer`, `ToolFilter`, or `PlanAwareCompressor`. This makes memahead
123
+ fully testable offline.
124
+
125
+ ## Development
126
+
127
+ ```bash
128
+ pip install -e ".[dev]"
129
+ pytest
130
+ ```
131
+
132
+ ## Academic foundations
133
+
134
+ memahead productizes findings from two papers that did not ship a usable
135
+ library. It is an independent implementation and is not affiliated with or
136
+ endorsed by the original authors.
137
+
138
+ - **PAACE** — Yuksel et al., *Plan-Aware Agent Context Engineering*,
139
+ arXiv:[2512.16970](https://arxiv.org/abs/2512.16970) (Dec 2025).
140
+ - **ACON** — Kang et al. (Microsoft), *Agent Context Optimization*,
141
+ arXiv:[2510.00615](https://arxiv.org/abs/2510.00615) (2025).
142
+
143
+ See [`NOTICE`](./NOTICE) for full attribution.
144
+
145
+ ## License
146
+
147
+ [Apache-2.0](./LICENSE).
@@ -0,0 +1,116 @@
1
+ # memahead
2
+
3
+ **Agent memory optimized for what's ahead.**
4
+
5
+ memahead compresses an LLM agent's context at *each step* of a multi-step
6
+ workflow using forward-looking, plan-aware retention. Unlike tools that
7
+ compress greedily based on what already happened, memahead scores every chunk
8
+ of context against the **remaining steps in the plan** and drops what future
9
+ steps won't need — dramatically fewer tokens per agent call, without losing the
10
+ information that matters downstream.
11
+
12
+ memahead sits on top of [Headroom](https://pypi.org/project/headroom-ai/)
13
+ (`pip install headroom-ai`), which performs the underlying compression
14
+ mechanics. memahead adds the plan-aware retention scoring layer.
15
+
16
+ ## Install
17
+
18
+ ```bash
19
+ pip install memahead
20
+ ```
21
+
22
+ This pulls in `headroom-ai`, `sentence-transformers`, and `numpy`. For more
23
+ accurate token accounting, also install the optional extra:
24
+
25
+ ```bash
26
+ pip install "memahead[tokenizers]" # adds tiktoken
27
+ ```
28
+
29
+ ## Quick example
30
+
31
+ ```python
32
+ from memahead import Plan, Step, PlanAwareCompressor
33
+
34
+ plan = Plan([
35
+ Step("research", "Search and gather raw facts about the topic"),
36
+ Step("synthesize", "Identify key themes across the research"),
37
+ Step("draft", "Write a structured first draft"),
38
+ Step("revise", "Produce the final polished output"),
39
+ ])
40
+
41
+ compressor = PlanAwareCompressor(quality=0.85)
42
+
43
+ compressed = compressor.compress(
44
+ history=prior_messages, # your prior chat messages
45
+ tools=all_tool_schemas, # the full tool catalog
46
+ plan=plan,
47
+ current_step="synthesize", # the step about to run
48
+ )
49
+
50
+ response = llm.call(
51
+ messages=compressed.messages,
52
+ tools=compressed.tools,
53
+ )
54
+
55
+ print(compressed.report)
56
+ # TokenReport(before=12400, after=3100, saved=9300, compression_ratio=0.75)
57
+ ```
58
+
59
+ ## How it works
60
+
61
+ For the step about to run, memahead:
62
+
63
+ 1. **Splits** the conversation history into chunks (one per message).
64
+ 2. **Scores** each chunk against the *remaining* plan steps with a
65
+ `RetentionScorer` — embedding both with `all-MiniLM-L6-v2` and taking the
66
+ cosine similarity. A chunk is valuable if a future step is likely to need it.
67
+ 3. **Drops** chunks that future steps won't need (system messages and the
68
+ current turn's input are always retained).
69
+ 4. **Filters** the tool catalog down to schemas relevant to the current step —
70
+ deterministically, with no extra LLM call (`tool_filter`).
71
+ 5. **Hands** the survivors to Headroom for the actual mechanical compression.
72
+ 6. **Returns** a `CompressedContext` with lean `messages`, filtered `tools`,
73
+ and a `TokenReport` of exactly what was saved.
74
+
75
+ The `quality` dial (0.0–1.0) trades tokens for retention: higher keeps more
76
+ context, lower compresses more aggressively. Pass an explicit
77
+ `retention_threshold` for fully reproducible runs.
78
+
79
+ ## Public API
80
+
81
+ | Symbol | Purpose |
82
+ | --- | --- |
83
+ | `Step`, `Plan`, `PlanGraph` | Model linear or branching workflows; `plan.remaining_from(step)` is the forward horizon. |
84
+ | `RetentionScorer` | Forward-looking chunk scoring (the core novelty). |
85
+ | `ToolFilter`, `filter_tools` | Deterministic, LLM-free tool-schema filtering. |
86
+ | `PlanAwareCompressor` | The full pipeline. |
87
+ | `CompressedContext`, `TokenReport` | Results and savings accounting. |
88
+
89
+ The embedding backend is swappable: pass any callable
90
+ `list[str] -> np.ndarray` (or an object with `.encode`) as `embedder=` to
91
+ `RetentionScorer`, `ToolFilter`, or `PlanAwareCompressor`. This makes memahead
92
+ fully testable offline.
93
+
94
+ ## Development
95
+
96
+ ```bash
97
+ pip install -e ".[dev]"
98
+ pytest
99
+ ```
100
+
101
+ ## Academic foundations
102
+
103
+ memahead productizes findings from two papers that did not ship a usable
104
+ library. It is an independent implementation and is not affiliated with or
105
+ endorsed by the original authors.
106
+
107
+ - **PAACE** — Yuksel et al., *Plan-Aware Agent Context Engineering*,
108
+ arXiv:[2512.16970](https://arxiv.org/abs/2512.16970) (Dec 2025).
109
+ - **ACON** — Kang et al. (Microsoft), *Agent Context Optimization*,
110
+ arXiv:[2510.00615](https://arxiv.org/abs/2510.00615) (2025).
111
+
112
+ See [`NOTICE`](./NOTICE) for full attribution.
113
+
114
+ ## License
115
+
116
+ [Apache-2.0](./LICENSE).