atelya 0.1.19__tar.gz

atelya-0.1.19/LICENSE

@@ -0,0 +1,202 @@
+
+                                 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
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   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.

atelya-0.1.19/PKG-INFO

@@ -0,0 +1,171 @@
+Metadata-Version: 2.4
+Name: atelya
+Version: 0.1.19
+Summary: AI-first memory OS: semantic recall that returns reusable KV. One lifecycle memory, three front doors (self-host serve, closed-LLM proxy, MCP server).
+Author: amem
+License: Apache-2.0
+Keywords: memory,llm,kv-cache,rag,mcp,agents,vllm
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Requires-Dist: numpy>=1.26
+Requires-Dist: fastembed>=0.3
+Requires-Dist: fastapi>=0.110
+Requires-Dist: uvicorn>=0.27
+Requires-Dist: pydantic>=2
+Requires-Dist: mcp>=1.0
+Provides-Extra: selfhost
+Requires-Dist: vllm>=0.6; extra == "selfhost"
+Requires-Dist: transformers>=4.40; extra == "selfhost"
+Requires-Dist: torch; extra == "selfhost"
+Provides-Extra: langgraph
+Requires-Dist: langgraph>=0.2; extra == "langgraph"
+Dynamic: license-file
+
+# Atelya OS — KV-native memory for self-hosted agents
+
+> Agent memory that lives in the model's **KV cache**, not just in text.
+> Built for teams self-hosting open-model inference (vLLM / SGLang) with heavy, long-lived memory.
+
+```bash
+pip install atelya
+```
+
+Most memory systems store **text** and re-prefill it into the prompt **every turn** — so the cost of
+serving memory grows linearly with turns. Atelya OS (`amem`) keeps the relevant working set as
+**reused KV**: compute it once, reuse it, don't recompute memory each turn.
+
+---
+
+## What's measured (not estimated)
+
+All numbers below were measured on a single RTX 4070 with `bench_real.py` / `amem_headtohead.py` in
+this repo. Full methodology, per-query data, and honest limits: **[BENCHMARK.md](BENCHMARK.md)**.
+
+- **Fidelity — 97.5% answer-for-answer agreement** with a cold full re-prefill of the same chunks
+  (n = 200, LLM-judged). Reusing KV instead of recomputing it **does not change the answer**.
+- **Cost — ~6x to ~54x less prefill.** Reusing KV vs re-prefilling the same retrieved set is **~6x
+  cheaper per query** (n = 200, the conservative, default behavior); for a **stable session** the
+  one-time working set amortizes to **~54x** (measured, 30 queries). Your real number lands in that
+  range depending on how much the relevant memory changes per query. Break-even ~1 query.
+- **Quality — at parity, not a win.** Head-to-head vs Mem0 at a **matched answerer + injection
+  budget**, answer correctness was **60% (amem) vs 55% (Mem0)** — within noise at n = 20. We do
+  **not** claim a recall-accuracy win: dedicated recall systems (Mem0, Zep, EverOS) lead that, and
+  this comparison deliberately matches retrieval to isolate **cost**, so it does not reflect Mem0's
+  stronger production recall pipeline.
+
+> Honest framing for the cost number: lead with **~6x** (rigorous, n = 200). The **~54x** is the
+> best case (stable working set + Mem0 storing raw turns); Mem0's real extraction injects fewer
+> tokens and narrows the gap — but amem still never re-prefills its resident KV. See BENCHMARK.md.
+
+---
+
+## Who this is for
+
+- **Full fit — you self-host vLLM / SGLang on a CUDA GPU**, with memory-heavy or long-horizon
+  agents. You own inference, so you can inject KV -> you get the flat cost curve **and** the KV moat.
+- **Partial fit — closed APIs (OpenAI) or Ollama.** You can't inject KV into a model you don't
+  control, so amem **reduces** the per-turn memory bill but can't flatten it. The memory SDK still
+  helps; the KV-reuse cost curve does not apply.
+
+---
+
+## Install
+
+```bash
+pip install atelya                 # memory SDK + CLI (no GPU needed)
+pip install 'atelya[selfhost]'     # + vLLM / LMCache CacheBlend engine (CUDA GPU) — unlocks KV reuse
+```
+
+The ~6x–54x cost win needs the self-host engine (`[selfhost]`). **`pip install atelya` alone is the
+memory-layer SDK; the KV moat requires inference you control.** The Python package runs without the
+optional Rust engine (that engine is a commercial performance deepener, not required).
+
+---
+
+## Quickstart
+
+> Verified against **amem 0.1.18**. `kv-serve` (the KV-reuse moat) needs `amem[selfhost]` + a CUDA GPU.
+> No GPU? Swap in `amem proxy` (drop-in for Claude / GPT) — same SDK; the cost curve just doesn't apply.
+
+Start the KV-reuse memory server (loads the vLLM + CacheBlend engine):
+
+```bash
+amem kv-serve            # serves on http://localhost:8000  (needs amem[selfhost] + a CUDA GPU)
+```
+
+Use it from the tiny SDK — the second question reuses the first one's KV instead of re-prefilling
+the memory:
+
+```python
+from amem import Amem
+
+mem = Amem("http://localhost:8000")
+mem.remember("alice", ["Alice lives in Seattle and works at Boeing.",
+                       "Alice's sister Maria lives in Denver."])
+sid = mem.start_session("alice")                       # one resident working set for the chat
+print(mem.ask("alice", "Where does Alice's sister live?", session=sid))
+print(mem.ask("alice", "What company does Alice work for?", session=sid))   # different q -> reuses KV
+```
+
+Or drop it in behind the **standard OpenAI SDK** — point `base_url` at amem and pass `user` as the
+memory namespace (per-user residency is on by default):
+
+```python
+from openai import OpenAI
+
+client = OpenAI(base_url="http://localhost:8000/v1", api_key="not-needed")
+r = client.chat.completions.create(
+    model="amem", user="alice",
+    messages=[{"role": "user", "content": "Where does Alice's sister live?"}])
+print(r.choices[0].message.content)
+```
+
+---
+
+## CLI
+
+```
+amem proxy        # closed-LLM drop-in (Claude / GPT) + cache orchestration   (light, no GPU)
+amem mcp          # MCP server for Claude Desktop / Cursor / Claude Code       (stdio)
+amem serve        # self-host serve (local open model + KV residency)          [amem[selfhost]]
+amem kv-serve     # KV-native serve: CacheBlend reuse + KvPolicy eviction (moat) [amem[selfhost]]
+amem bench        # reproducible cost-curve benchmark (KV-residency vs re-prefill) [amem[selfhost]]
+amem version      # print version
+```
+
+Run `amem --help` for the authoritative list and flags.
+
+---
+
+## How it works — the bridge
+
+```
+text memory                amem (the bridge)                 KV memory
+re-prefilled every turn  -> recall the relevant set, then  -> its precomputed KV is REUSED
+(linear cost)               reuse its KV (not the text)       (one-time prefill, then ~flat)
+```
+
+- **CacheBlend** (via LMCache) reuses each chunk's attention KV **position-independently**, with
+  ~15% selective recompute — so an arbitrary set of recalled chunks can be served from cached KV
+  instead of a full re-prefill.
+- A **value-model residency policy** (relevance x recency x reuse - size) keeps the hottest memory
+  resident and tiers the rest to CPU/disk.
+
+---
+
+## What this is **not**
+
+- **Not a recall-accuracy leaderboard claim.** Mem0 / Zep / EverOS lead LoCoMo / LongMemEval recall;
+  amem composes with a recall layer. Its edge is the **cost of serving memory at parity fidelity**.
+- **Transformer-only.** CacheBlend reuses per-token attention KV. SSM / Mamba-hybrid models keep a
+  compressed recurrent state — there is no per-token KV to blend — so the KV-reuse moat does not
+  apply to them.
+- **A storage trade.** KV is ~1000x the size of the text it represents; amem tiers it to CPU/disk.
+  You buy lower compute with more storage.
+
+---
+
+## Status & license
+
+Experimental, in active development — expect rough edges. Apache-2.0.

atelya-0.1.19/README.md

@@ -0,0 +1,147 @@
+# Atelya OS — KV-native memory for self-hosted agents
+
+> Agent memory that lives in the model's **KV cache**, not just in text.
+> Built for teams self-hosting open-model inference (vLLM / SGLang) with heavy, long-lived memory.
+
+```bash
+pip install atelya
+```
+
+Most memory systems store **text** and re-prefill it into the prompt **every turn** — so the cost of
+serving memory grows linearly with turns. Atelya OS (`amem`) keeps the relevant working set as
+**reused KV**: compute it once, reuse it, don't recompute memory each turn.
+
+---
+
+## What's measured (not estimated)
+
+All numbers below were measured on a single RTX 4070 with `bench_real.py` / `amem_headtohead.py` in
+this repo. Full methodology, per-query data, and honest limits: **[BENCHMARK.md](BENCHMARK.md)**.
+
+- **Fidelity — 97.5% answer-for-answer agreement** with a cold full re-prefill of the same chunks
+  (n = 200, LLM-judged). Reusing KV instead of recomputing it **does not change the answer**.
+- **Cost — ~6x to ~54x less prefill.** Reusing KV vs re-prefilling the same retrieved set is **~6x
+  cheaper per query** (n = 200, the conservative, default behavior); for a **stable session** the
+  one-time working set amortizes to **~54x** (measured, 30 queries). Your real number lands in that
+  range depending on how much the relevant memory changes per query. Break-even ~1 query.
+- **Quality — at parity, not a win.** Head-to-head vs Mem0 at a **matched answerer + injection
+  budget**, answer correctness was **60% (amem) vs 55% (Mem0)** — within noise at n = 20. We do
+  **not** claim a recall-accuracy win: dedicated recall systems (Mem0, Zep, EverOS) lead that, and
+  this comparison deliberately matches retrieval to isolate **cost**, so it does not reflect Mem0's
+  stronger production recall pipeline.
+
+> Honest framing for the cost number: lead with **~6x** (rigorous, n = 200). The **~54x** is the
+> best case (stable working set + Mem0 storing raw turns); Mem0's real extraction injects fewer
+> tokens and narrows the gap — but amem still never re-prefills its resident KV. See BENCHMARK.md.
+
+---
+
+## Who this is for
+
+- **Full fit — you self-host vLLM / SGLang on a CUDA GPU**, with memory-heavy or long-horizon
+  agents. You own inference, so you can inject KV -> you get the flat cost curve **and** the KV moat.
+- **Partial fit — closed APIs (OpenAI) or Ollama.** You can't inject KV into a model you don't
+  control, so amem **reduces** the per-turn memory bill but can't flatten it. The memory SDK still
+  helps; the KV-reuse cost curve does not apply.
+
+---
+
+## Install
+
+```bash
+pip install atelya                 # memory SDK + CLI (no GPU needed)
+pip install 'atelya[selfhost]'     # + vLLM / LMCache CacheBlend engine (CUDA GPU) — unlocks KV reuse
+```
+
+The ~6x–54x cost win needs the self-host engine (`[selfhost]`). **`pip install atelya` alone is the
+memory-layer SDK; the KV moat requires inference you control.** The Python package runs without the
+optional Rust engine (that engine is a commercial performance deepener, not required).
+
+---
+
+## Quickstart
+
+> Verified against **amem 0.1.18**. `kv-serve` (the KV-reuse moat) needs `amem[selfhost]` + a CUDA GPU.
+> No GPU? Swap in `amem proxy` (drop-in for Claude / GPT) — same SDK; the cost curve just doesn't apply.
+
+Start the KV-reuse memory server (loads the vLLM + CacheBlend engine):
+
+```bash
+amem kv-serve            # serves on http://localhost:8000  (needs amem[selfhost] + a CUDA GPU)
+```
+
+Use it from the tiny SDK — the second question reuses the first one's KV instead of re-prefilling
+the memory:
+
+```python
+from amem import Amem
+
+mem = Amem("http://localhost:8000")
+mem.remember("alice", ["Alice lives in Seattle and works at Boeing.",
+                       "Alice's sister Maria lives in Denver."])
+sid = mem.start_session("alice")                       # one resident working set for the chat
+print(mem.ask("alice", "Where does Alice's sister live?", session=sid))
+print(mem.ask("alice", "What company does Alice work for?", session=sid))   # different q -> reuses KV
+```
+
+Or drop it in behind the **standard OpenAI SDK** — point `base_url` at amem and pass `user` as the
+memory namespace (per-user residency is on by default):
+
+```python
+from openai import OpenAI
+
+client = OpenAI(base_url="http://localhost:8000/v1", api_key="not-needed")
+r = client.chat.completions.create(
+    model="amem", user="alice",
+    messages=[{"role": "user", "content": "Where does Alice's sister live?"}])
+print(r.choices[0].message.content)
+```
+
+---
+
+## CLI
+
+```
+amem proxy        # closed-LLM drop-in (Claude / GPT) + cache orchestration   (light, no GPU)
+amem mcp          # MCP server for Claude Desktop / Cursor / Claude Code       (stdio)
+amem serve        # self-host serve (local open model + KV residency)          [amem[selfhost]]
+amem kv-serve     # KV-native serve: CacheBlend reuse + KvPolicy eviction (moat) [amem[selfhost]]
+amem bench        # reproducible cost-curve benchmark (KV-residency vs re-prefill) [amem[selfhost]]
+amem version      # print version
+```
+
+Run `amem --help` for the authoritative list and flags.
+
+---
+
+## How it works — the bridge
+
+```
+text memory                amem (the bridge)                 KV memory
+re-prefilled every turn  -> recall the relevant set, then  -> its precomputed KV is REUSED
+(linear cost)               reuse its KV (not the text)       (one-time prefill, then ~flat)
+```
+
+- **CacheBlend** (via LMCache) reuses each chunk's attention KV **position-independently**, with
+  ~15% selective recompute — so an arbitrary set of recalled chunks can be served from cached KV
+  instead of a full re-prefill.
+- A **value-model residency policy** (relevance x recency x reuse - size) keeps the hottest memory
+  resident and tiers the rest to CPU/disk.
+
+---
+
+## What this is **not**
+
+- **Not a recall-accuracy leaderboard claim.** Mem0 / Zep / EverOS lead LoCoMo / LongMemEval recall;
+  amem composes with a recall layer. Its edge is the **cost of serving memory at parity fidelity**.
+- **Transformer-only.** CacheBlend reuses per-token attention KV. SSM / Mamba-hybrid models keep a
+  compressed recurrent state — there is no per-token KV to blend — so the KV-reuse moat does not
+  apply to them.
+- **A storage trade.** KV is ~1000x the size of the text it represents; amem tiers it to CPU/disk.
+  You buy lower compute with more storage.
+
+---
+
+## Status & license
+
+Experimental, in active development — expect rough edges. Apache-2.0.

atelya-0.1.19/amem/__init__.py

@@ -0,0 +1,17 @@
+"""amem — AI-first memory OS: semantic recall that returns reusable KV.
+
+Four front doors on ONE lifecycle memory store (~/amem_data):
+  - kv-serve : self-host KV-native moat (CacheBlend position-independent reuse
+               + KvPolicy value-model eviction). Hardened: API-key auth,
+               input validation, durable startup, per-user concurrency,
+               $-saved observability. -> the full KV moat, production-shaped.
+  - serve    : self-host APC serve (local open model + KV residency).
+  - proxy    : closed-LLM drop-in (Claude/GPT) + cache orchestration -> on-ramp.
+  - mcp      : MCP server for Claude Desktop / Cursor / Claude Code (stdio).
+"""
+__version__ = "0.1.19"
+
+from .memory import MemoryStore, Session  # noqa: F401
+from .client import Amem, AmemError  # noqa: F401  (stdlib-only SDK; cheap to import)
+
+__all__ = ["MemoryStore", "Session", "Amem", "AmemError", "__version__"]