awm 0.1.0__tar.gz

awm-0.1.0/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.

awm-0.1.0/PKG-INFO

@@ -0,0 +1,58 @@
+Metadata-Version: 2.4
+Name: awm
+Version: 0.1.0
+Summary: A portable, scoped agent memory — hierarchical tenant:user:project scopes where a write lands at exactly one scope, a read includes ancestors by distance, and siblings never leak.
+License: Apache-2.0
+Project-URL: Homepage, https://github.com/Aitherium/awm
+Project-URL: Repository, https://github.com/Aitherium/awm.git
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Provides-Extra: dev
+Requires-Dist: pytest>=7.0; extra == "dev"
+Dynamic: license-file
+
+# awm
+
+A portable, scoped agent memory. SQLite, no service, no network.
+
+```
+platform:*:*               everyone
+{tenant}:*:*               one org
+{tenant}:{user}:*          one person
+{tenant}:{user}:{project}  one piece of work
+```
+
+```bash
+pip install awm
+
+awm remember --scope acme:alice:orchestrator --key recipe --value "rank 16, lr 2e-5"
+awm recall   --scope acme:alice:orchestrator
+```
+
+## Two rules, deliberately asymmetric
+
+**A write lands at exactly one scope.** Writing "somewhere in this subtree" is
+how a memory becomes visible to a scope its author never considered.
+
+**A read includes ancestors, weighted by distance.** A project query surfaces
+the user's preferences and the platform's conventions — that is the point of a
+hierarchy — but a platform fact must not outrank a project fact just because it
+was written first.
+
+## One property that is security, not tidiness
+
+**Siblings never see each other.** `acme:alice:*` and `acme:bob:*` share an
+ancestor and nothing else. The scope check is segment-wise, never a string
+prefix, because `"acmecorp:...".startswith("acme")` is `True` — that is one
+customer's memory entering another's context, silently, with the answer still
+looking like an answer. SQL narrows by an exact computed set, never a `LIKE`.
+
+`platform` is a reserved sentinel tenant meaning "everyone", not an
+organisation. Treating it as a literal tenant name made the root of the
+hierarchy invisible from every scope — every recall still returned results, just
+never the platform's. The self-test carries that case.
+
+## Licence
+
+Apache-2.0.

awm-0.1.0/README.md

@@ -0,0 +1,44 @@
+# awm
+
+A portable, scoped agent memory. SQLite, no service, no network.
+
+```
+platform:*:*               everyone
+{tenant}:*:*               one org
+{tenant}:{user}:*          one person
+{tenant}:{user}:{project}  one piece of work
+```
+
+```bash
+pip install awm
+
+awm remember --scope acme:alice:orchestrator --key recipe --value "rank 16, lr 2e-5"
+awm recall   --scope acme:alice:orchestrator
+```
+
+## Two rules, deliberately asymmetric
+
+**A write lands at exactly one scope.** Writing "somewhere in this subtree" is
+how a memory becomes visible to a scope its author never considered.
+
+**A read includes ancestors, weighted by distance.** A project query surfaces
+the user's preferences and the platform's conventions — that is the point of a
+hierarchy — but a platform fact must not outrank a project fact just because it
+was written first.
+
+## One property that is security, not tidiness
+
+**Siblings never see each other.** `acme:alice:*` and `acme:bob:*` share an
+ancestor and nothing else. The scope check is segment-wise, never a string
+prefix, because `"acmecorp:...".startswith("acme")` is `True` — that is one
+customer's memory entering another's context, silently, with the answer still
+looking like an answer. SQL narrows by an exact computed set, never a `LIKE`.
+
+`platform` is a reserved sentinel tenant meaning "everyone", not an
+organisation. Treating it as a literal tenant name made the root of the
+hierarchy invisible from every scope — every recall still returned results, just
+never the platform's. The self-test carries that case.
+
+## Licence
+
+Apache-2.0.

awm-0.1.0/awm/__init__.py

@@ -0,0 +1,56 @@
+"""awm — a portable, scoped agent memory. SQLite, no service, no network.
+
+Extracted from AitherOS's ScopedMemory. The service plumbing does not
+generalise; the semantics do:
+
+    platform:*:*               everyone
+    {tenant}:*:*               one org
+    {tenant}:{user}:*          one person
+    {tenant}:{user}:{project}  one piece of work
+
+    import awm
+    st = awm.MemoryStore(Path("memory.db"))
+    st.remember(awm.Scope("acme", "alice", "orchestrator"), "recipe",
+                "rank 16, lr 2e-5")
+    st.recall(awm.Scope("acme", "alice", "orchestrator"))
+
+Two rules, deliberately asymmetric:
+
+- **A write lands at exactly one scope.** Writing "somewhere in this subtree" is
+  how a memory becomes visible to a scope its author never considered.
+- **A read includes ancestors, weighted by distance.** A project query should
+  surface the user's preferences and the platform's conventions — but a
+  platform fact must not outrank a project fact just because it was older.
+
+And one property that is security, not tidiness: **siblings never see each
+other.** The scope check is segment-wise, never a string prefix, because
+`"acmecorp:...".startswith("acme")` is True — that is one customer's memory
+entering another's context, silently, with the answer still looking like an
+answer. SQL narrows by an exact computed set, never by a LIKE.
+"""
+
+from __future__ import annotations
+
+from .scope import (
+    ANCESTOR_DECAY,
+    PLATFORM,
+    WILDCARD,
+    Scope,
+    ScopeError,
+    visible_scopes,
+)
+from .store import SCHEMA_VERSION, Memory, MemoryStore
+
+__version__ = "0.1.0"
+
+__all__ = [
+    "ANCESTOR_DECAY",
+    "PLATFORM",
+    "SCHEMA_VERSION",
+    "Memory",
+    "MemoryStore",
+    "Scope",
+    "ScopeError",
+    "WILDCARD",
+    "visible_scopes",
+]

awm-0.1.0/awm/cli.py

@@ -0,0 +1,190 @@
+"""`awm` — a portable, scoped agent memory.
+
+    awm remember --scope acme:alice:proj --key style --value "prefers tables"
+    awm recall   --scope acme:alice:proj [--query tables]
+    awm forget   --scope acme:alice:proj --key style
+    awm --self-test
+
+Scopes are `tenant:user:project`, `*` meaning "not narrowed here". A write lands
+at exactly one scope; a read sees that scope and its ancestors, weighted by
+distance, and never a sibling.
+"""
+
+from __future__ import annotations
+
+import argparse
+import json
+import sys
+from pathlib import Path
+
+from .scope import Scope, ScopeError
+from .store import MemoryStore
+
+DEFAULT_DB = Path.home() / ".aither" / "awm" / "memory.db"
+
+
+def _store(a) -> MemoryStore:
+    return MemoryStore(Path(a.db) if a.db else DEFAULT_DB)
+
+
+def _cmd_remember(a) -> int:
+    with _store(a) as st:
+        m = st.remember(Scope.parse(a.scope), a.key, a.value, kind=a.kind)
+    print(f"remembered {m.key} at {m.scope}")
+    return 0
+
+
+def _cmd_recall(a) -> int:
+    with _store(a) as st:
+        rows = st.recall(Scope.parse(a.scope), query=a.query, limit=a.limit,
+                         kind=a.kind)
+    if a.json:
+        print(json.dumps([r.to_dict() for r in rows], indent=2))
+        return 0
+    if not rows:
+        print("no memories visible from this scope")
+        return 0
+    for r in rows:
+        print(f"[{r.weight:.2f}] {r.scope:28} {r.key:20} {r.value[:60]}")
+    return 0
+
+
+def _cmd_forget(a) -> int:
+    with _store(a) as st:
+        gone = st.forget(Scope.parse(a.scope), a.key)
+    print("forgotten" if gone else "no such memory at that exact scope")
+    return 0 if gone else 1
+
+
+def self_test() -> int:
+    import tempfile
+    ok = True
+
+    def chk(label, got, want):
+        nonlocal ok
+        good = got == want
+        ok = ok and good
+        print(f"  {'PASS' if good else 'FAIL'}  {label} -> {got!r} (want {want!r})")
+
+    with tempfile.TemporaryDirectory() as td:
+        db = Path(td) / "m.db"
+        st = MemoryStore(db)
+
+        plat = Scope("platform")
+        acme = Scope("acme")
+        alice = Scope("acme", "alice")
+        proj = Scope("acme", "alice", "orchestrator")
+        bob = Scope("acme", "bob")
+        globex = Scope("globex")
+        # The prefix trap, as a real tenant.
+        acmecorp = Scope("acmecorp")
+
+        st.remember(plat, "convention", "anchor the keep-set")
+        st.remember(acme, "policy", "no cloud inference")
+        st.remember(alice, "style", "prefers tables")
+        st.remember(proj, "recipe", "rank 16, lr 2e-5")
+        st.remember(bob, "style", "prefers prose")
+        st.remember(globex, "policy", "cloud is fine")
+        st.remember(acmecorp, "policy", "different company entirely")
+
+        seen = {m.key for m in st.recall(proj)}
+        chk("a project read sees its own memory", "recipe" in seen, True)
+        chk("  and its user's", "style" in seen, True)
+        chk("  and its tenant's", "policy" in seen, True)
+        chk("  and the platform's", "convention" in seen, True)
+
+        # THE SECURITY PROPERTY. Siblings share an ancestor and nothing else.
+        vals = {m.value for m in st.recall(proj)}
+        chk("a sibling USER's memory is invisible",
+            "prefers prose" in vals, False)
+        chk("another TENANT's memory is invisible",
+            "cloud is fine" in vals, False)
+        # The prefix trap: `"acmecorp:...".startswith("acme")` is True, and a
+        # LIKE-based query leaks here silently.
+        chk("a tenant whose name PREFIXES ours is invisible",
+            "different company entirely" in vals, False)
+
+        # Nearer scopes must outrank further ones, or a hierarchy is just a bag.
+        rows = st.recall(proj)
+        chk("the nearest scope ranks first", rows[0].key, "recipe")
+        chk("  and the platform fact ranks last", rows[-1].key, "convention")
+        chk("  weights decay with distance", rows[0].weight > rows[-1].weight, True)
+
+        # A read from a WIDER scope must not see narrower memories: alice's
+        # style is not the tenant's.
+        tenant_vals = {m.value for m in st.recall(acme)}
+        chk("a tenant read does NOT see a user's memory",
+            "prefers tables" in tenant_vals, False)
+        chk("  but does see its own", "no cloud inference" in tenant_vals, True)
+
+        # forget is exact, never cascading.
+        chk("forget at the wrong scope does nothing", st.forget(acme, "style"), False)
+        chk("  the memory survives", any(m.key == "style" for m in st.recall(alice)), True)
+        chk("forget at the exact scope works", st.forget(alice, "style"), True)
+
+        # Malformed scopes refuse rather than normalise.
+        for bad in ("acme", "a:b:c:d", "", "acme::proj"):
+            try:
+                Scope.parse(bad)
+                chk(f"refuses malformed scope {bad!r}", "no raise", "raise")
+            except ScopeError:
+                chk(f"refuses malformed scope {bad!r}", "raise", "raise")
+        try:
+            Scope("acme", "*", "secret")
+            chk("refuses a project under a wildcard user", "no raise", "raise")
+        except ScopeError:
+            chk("refuses a project under a wildcard user", "raise", "raise")
+        try:
+            Scope("ac:me")
+            chk("refuses a separator inside a segment", "no raise", "raise")
+        except ScopeError:
+            chk("refuses a separator inside a segment", "raise", "raise")
+
+        st.close()
+
+    print("\nself-test:", "PASS" if ok else "FAIL")
+    return 0 if ok else 1
+
+
+def main(argv=None) -> int:
+    ap = argparse.ArgumentParser(prog="awm", description=__doc__,
+                                 formatter_class=argparse.RawDescriptionHelpFormatter)
+    ap.add_argument("--self-test", action="store_true")
+    ap.add_argument("--db")
+    sub = ap.add_subparsers(dest="cmd")
+
+    r = sub.add_parser("remember")
+    r.add_argument("--scope", required=True)
+    r.add_argument("--key", required=True)
+    r.add_argument("--value", required=True)
+    r.add_argument("--kind", default="fact")
+    r.set_defaults(fn=_cmd_remember)
+
+    c = sub.add_parser("recall")
+    c.add_argument("--scope", required=True)
+    c.add_argument("--query")
+    c.add_argument("--kind")
+    c.add_argument("--limit", type=int, default=20)
+    c.add_argument("--json", action="store_true")
+    c.set_defaults(fn=_cmd_recall)
+
+    f = sub.add_parser("forget")
+    f.add_argument("--scope", required=True)
+    f.add_argument("--key", required=True)
+    f.set_defaults(fn=_cmd_forget)
+
+    a = ap.parse_args(argv)
+    if a.self_test:
+        return self_test()
+    if not getattr(a, "fn", None):
+        ap.print_help()
+        return 2
+    try:
+        return a.fn(a)
+    except ScopeError as exc:
+        print(f"REFUSED: {exc}", file=sys.stderr)
+        return 2
+
+
+if __name__ == "__main__":
+    sys.exit(main())

awm-0.1.0/awm/scope.py

@@ -0,0 +1,182 @@
+"""Hierarchical memory scopes: what an agent may see, and what it may not.
+
+Extracted from AitherOS's ScopedMemory, which wraps a memory service and a
+knowledge graph with project-aware scoping. The service plumbing does not
+generalise; the SEMANTICS do, and they are the whole value:
+
+    platform:*:*              everyone
+    {tenant}:*:*              one org
+    {tenant}:{user}:*         one person
+    {tenant}:{user}:{project} one piece of work
+
+Two rules, and they are deliberately asymmetric:
+
+- **A write lands at EXACTLY ONE scope.** Writing "somewhere in this subtree" is
+  how a memory ends up visible to a scope its author never considered.
+- **A read includes ANCESTORS, with diminishing weight.** Asking at project
+  level should surface the user's preferences and the platform's conventions —
+  that is the point of a hierarchy — but a platform fact must never outrank a
+  project fact simply because it was written first.
+
+WHAT MUST NEVER HAPPEN, AND WHY IT IS A SECURITY PROPERTY RATHER THAN A BUG
+
+Siblings must not see each other. `acme:alice:*` and `acme:bob:*` share an
+ancestor and are otherwise unrelated; `acme:*:*` and `globex:*:*` share only the
+root. A retrieval that walks the tree loosely — a `LIKE 'acme:%'` here, a
+prefix compare there — leaks one customer's memory into another's context, and
+it leaks SILENTLY: the answer still looks like an answer.
+
+Prefix matching is the specific trap and it is not hypothetical: `acme` is a
+prefix of `acmecorp`, so `scope.startswith(ancestor)` returns True for two
+unrelated tenants. Scopes here are compared SEGMENT-WISE, never as strings, and
+the self-test carries that exact pair as a case.
+"""
+
+from __future__ import annotations
+
+from dataclasses import dataclass
+from typing import List, Tuple
+
+SEP = ":"
+WILDCARD = "*"
+PLATFORM = "platform"
+
+#: How much an ancestor's memories are discounted per level of distance. A
+#: project fact and a platform fact are both relevant; the nearer one should
+#: win. Applied multiplicatively, so two levels up is 0.25 rather than 0.
+ANCESTOR_DECAY = 0.5
+
+
+class ScopeError(ValueError):
+    """A malformed or unsafe scope. Raised rather than normalised.
+
+    "Fixing" a bad scope quietly is how a memory lands somewhere its author did
+    not intend — and the write succeeds, so nothing looks wrong.
+    """
+
+
+@dataclass(frozen=True)
+class Scope:
+    """`tenant:user:project`, where `*` means "not narrowed at this level"."""
+
+    tenant: str
+    user: str = WILDCARD
+    project: str = WILDCARD
+
+    def __post_init__(self) -> None:
+        for name, part in (("tenant", self.tenant), ("user", self.user),
+                           ("project", self.project)):
+            if not part:
+                raise ScopeError(f"{name} must not be empty (use {WILDCARD!r})")
+            if SEP in part:
+                raise ScopeError(
+                    f"{name}={part!r} contains {SEP!r}, the scope separator — "
+                    f"that would silently re-partition the scope")
+        # A narrower level under a wildcard is meaningless and, worse,
+        # ambiguous: `acme:*:secret` reads as "that project for every user",
+        # which no ancestor walk can express consistently.
+        if self.user == WILDCARD and self.project != WILDCARD:
+            raise ScopeError(
+                f"project={self.project!r} under a wildcard user is ambiguous — "
+                f"name the user, or widen the project to {WILDCARD!r}")
+
+    def __str__(self) -> str:
+        return SEP.join((self.tenant, self.user, self.project))
+
+    @property
+    def parts(self) -> Tuple[str, str, str]:
+        return (self.tenant, self.user, self.project)
+
+    @classmethod
+    def parse(cls, text: str) -> "Scope":
+        if not isinstance(text, str) or not text.strip():
+            raise ScopeError("scope must be a non-empty string")
+        bits = text.strip().split(SEP)
+        if len(bits) != 3:
+            raise ScopeError(
+                f"scope {text!r} must have exactly three segments "
+                f"(tenant{SEP}user{SEP}project); got {len(bits)}")
+        return cls(*bits)
+
+    @property
+    def is_platform(self) -> bool:
+        """`platform` is a SENTINEL tenant meaning "everyone", not a tenant.
+
+        Reserved: a real organisation cannot be called `platform` here. The
+        alternative — resolving the ambiguity at read time — means a tenant
+        could name itself into the root of the hierarchy and see every other
+        tenant's memories.
+        """
+        return self.tenant == PLATFORM
+
+    @property
+    def depth(self) -> int:
+        """How specific this scope is: 0 platform-wide … 3 one project.
+
+        The platform scope is depth 0, not 1. It names no organisation; it is
+        the root every other scope descends from, and counting its sentinel
+        tenant as a narrowing put it at the same distance as a real tenant —
+        which is how it came to be invisible from everywhere.
+        """
+        if self.is_platform:
+            return 0
+        return sum(1 for p in self.parts if p != WILDCARD)
+
+    def ancestors(self) -> List["Scope"]:
+        """Every scope a read at this scope may ALSO see, nearest first.
+
+        Never includes siblings. Widening happens strictly right-to-left, which
+        is what keeps `acme:alice:*` from ever reaching `acme:bob:*`.
+        """
+        out: List[Scope] = []
+        tenant, user, project = self.parts
+        if project != WILDCARD:
+            out.append(Scope(tenant, user, WILDCARD))
+        if user != WILDCARD:
+            out.append(Scope(tenant, WILDCARD, WILDCARD))
+        if tenant != PLATFORM:
+            out.append(Scope(PLATFORM, WILDCARD, WILDCARD))
+        return out
+
+    def covers(self, other: "Scope") -> bool:
+        """True when a read at `other` may see memories written at `self`.
+
+        Segment-wise, never a string prefix. `Scope("acme").covers(...)` must
+        not match tenant `acmecorp`, and `"acmecorp:...".startswith("acme")` is
+        True — which is precisely how one customer's memory reaches another's
+        context, silently, with the answer still looking like an answer.
+        """
+        if not isinstance(other, Scope):
+            raise ScopeError(f"expected a Scope, got {type(other).__name__}")
+        # The platform scope is the root of the hierarchy and covers every
+        # scope. Comparing its sentinel tenant literally made `platform:*:*`
+        # cover NOTHING — so platform-wide conventions reached no agent, and
+        # the failure was a silence: every recall still returned results, just
+        # never that one.
+        if self.is_platform:
+            return True
+        for mine, theirs in zip(self.parts, other.parts):
+            if mine == WILDCARD:
+                continue
+            if mine != theirs:
+                return False
+        return True
+
+    def weight_for(self, query: "Scope") -> float:
+        """Relevance multiplier for a memory at `self` read from `query`.
+
+        1.0 at the query's own scope, decaying per level of distance. Returns
+        0.0 when this scope is not visible from `query` at all — a caller that
+        forgets to filter still gets a zero rather than a leak.
+        """
+        if not self.covers(query):
+            return 0.0
+        distance = query.depth - self.depth
+        if distance < 0:
+            return 0.0
+        return ANCESTOR_DECAY ** distance
+
+
+def visible_scopes(query: Scope) -> List[Scope]:
+    """The query scope plus its ancestors, nearest first."""
+    return [query, *query.ancestors()]

awm-0.1.0/awm/store.py

@@ -0,0 +1,174 @@
+"""A portable, scoped agent memory. SQLite, no service, no network.
+
+`remember` writes at exactly one scope. `recall` reads that scope and its
+ancestors, weighted by distance, and nothing else.
+
+WHY SQLITE AND WHY THE FILTERING IS IN PYTHON
+
+The scope check is the security boundary, and it is done in `Scope.covers` —
+segment-wise — rather than in SQL. A `LIKE 'acme:%'` is one keystroke from
+matching `acmecorp:...`, and the failure is silent: the query returns rows, the
+agent answers, and one customer's memory has entered another's context. So SQL
+narrows by an exact set of scope strings computed in Python, and never by a
+pattern.
+
+That set is small by construction — a scope has at most three ancestors — so
+"filter in Python" costs an `IN (?,?,?,?)` and buys a boundary that can be
+read, tested and reasoned about in one function.
+"""
+
+from __future__ import annotations
+
+import json
+import sqlite3
+import time
+from dataclasses import dataclass
+from pathlib import Path
+from typing import Any, Dict, List, Optional
+
+from .scope import Scope, ScopeError, visible_scopes
+
+SCHEMA_VERSION = 1
+
+_SCHEMA = """
+CREATE TABLE IF NOT EXISTS memories (
+    id        INTEGER PRIMARY KEY AUTOINCREMENT,
+    scope     TEXT NOT NULL,
+    key       TEXT NOT NULL,
+    value     TEXT NOT NULL,
+    kind      TEXT NOT NULL DEFAULT 'fact',
+    created   REAL NOT NULL,
+    updated   REAL NOT NULL,
+    hits      INTEGER NOT NULL DEFAULT 0,
+    meta      TEXT NOT NULL DEFAULT '{}',
+    UNIQUE(scope, key)
+);
+CREATE INDEX IF NOT EXISTS idx_scope ON memories(scope);
+CREATE TABLE IF NOT EXISTS schema_meta (version INTEGER NOT NULL);
+"""
+
+
+@dataclass
+class Memory:
+    scope: str
+    key: str
+    value: str
+    kind: str
+    created: float
+    updated: float
+    hits: int
+    meta: Dict[str, Any]
+    weight: float = 1.0
+
+    def to_dict(self) -> Dict[str, Any]:
+        d = {"scope": self.scope, "key": self.key, "value": self.value,
+             "kind": self.kind, "created": self.created,
+             "updated": self.updated, "hits": self.hits, "meta": self.meta}
+        d["weight"] = self.weight
+        return d
+
+
+class MemoryStore:
+    """Scoped memory backed by one SQLite file."""
+
+    def __init__(self, path: Path):
+        self.path = Path(path)
+        self.path.parent.mkdir(parents=True, exist_ok=True)
+        self._db = sqlite3.connect(str(self.path))
+        self._db.row_factory = sqlite3.Row
+        self._db.executescript(_SCHEMA)
+        row = self._db.execute("SELECT version FROM schema_meta").fetchone()
+        if row is None:
+            self._db.execute("INSERT INTO schema_meta(version) VALUES (?)",
+                             (SCHEMA_VERSION,))
+            self._db.commit()
+        elif row["version"] != SCHEMA_VERSION:
+            raise ScopeError(
+                f"{self.path} is schema version {row['version']}, this is "
+                f"{SCHEMA_VERSION}. Refusing to read it — a misread row here is "
+                f"a memory attributed to the wrong scope")
+
+    def close(self) -> None:
+        self._db.close()
+
+    def __enter__(self) -> "MemoryStore":
+        return self
+
+    def __exit__(self, *exc) -> None:
+        self.close()
+
+    def remember(self, scope: Scope, key: str, value: str, *,
+                 kind: str = "fact", meta: Optional[Dict[str, Any]] = None) -> Memory:
+        """Write at EXACTLY this scope. Upserts on (scope, key)."""
+        if not isinstance(scope, Scope):
+            raise ScopeError(f"expected a Scope, got {type(scope).__name__}")
+        if not key or not isinstance(key, str):
+            raise ScopeError("key must be a non-empty string")
+        now = time.time()
+        s = str(scope)
+        payload = json.dumps(meta or {}, sort_keys=True)
+        self._db.execute(
+            "INSERT INTO memories(scope,key,value,kind,created,updated,meta) "
+            "VALUES (?,?,?,?,?,?,?) "
+            "ON CONFLICT(scope,key) DO UPDATE SET value=excluded.value, "
+            "kind=excluded.kind, updated=excluded.updated, meta=excluded.meta",
+            (s, key, value, kind, now, now, payload))
+        self._db.commit()
+        return Memory(scope=s, key=key, value=value, kind=kind, created=now,
+                      updated=now, hits=0, meta=dict(meta or {}))
+
+    def recall(self, scope: Scope, *, query: Optional[str] = None,
+               limit: int = 20, kind: Optional[str] = None) -> List[Memory]:
+        """Read this scope and its ancestors, nearest-weighted. Nothing else."""
+        if not isinstance(scope, Scope):
+            raise ScopeError(f"expected a Scope, got {type(scope).__name__}")
+        wanted = visible_scopes(scope)
+        names = [str(s) for s in wanted]
+        # An exact IN over a computed set. Never a LIKE: `LIKE 'acme:%'` also
+        # matches `acmecorp:...`, and the leak is silent.
+        placeholders = ",".join("?" * len(names))
+        sql = f"SELECT * FROM memories WHERE scope IN ({placeholders})"
+        args: List[Any] = list(names)
+        if kind:
+            sql += " AND kind = ?"
+            args.append(kind)
+        rows = self._db.execute(sql, args).fetchall()
+
+        out: List[Memory] = []
+        for r in rows:
+            src = Scope.parse(r["scope"])
+            w = src.weight_for(scope)
+            if w <= 0.0:
+                # Belt and braces. The IN clause should make this unreachable;
+                # if it ever is reachable, dropping the row is the safe answer
+                # and a leak is not.
+                continue
+            if query and query.lower() not in (r["value"] or "").lower() \
+                    and query.lower() not in (r["key"] or "").lower():
+                continue
+            out.append(Memory(scope=r["scope"], key=r["key"], value=r["value"],
+                              kind=r["kind"], created=r["created"],
+                              updated=r["updated"], hits=r["hits"],
+                              meta=json.loads(r["meta"] or "{}"), weight=w))
+        # Nearest scope first, then most recently updated. A platform fact must
+        # not outrank a project fact just because it was written first.
+        out.sort(key=lambda m: (-m.weight, -m.updated))
+        return out[:limit]
+
+    def forget(self, scope: Scope, key: str) -> bool:
+        """Delete one memory at EXACTLY this scope. Never cascades.
+
+        A delete that walked descendants would let a tenant-level forget silently
+        remove a project's memories — destructive, invisible, and impossible to
+        undo from here.
+        """
+        cur = self._db.execute("DELETE FROM memories WHERE scope=? AND key=?",
+                               (str(scope), key))
+        self._db.commit()
+        return cur.rowcount > 0
+
+    def count(self, scope: Optional[Scope] = None) -> int:
+        if scope is None:
+            return self._db.execute("SELECT COUNT(*) c FROM memories").fetchone()["c"]
+        return self._db.execute("SELECT COUNT(*) c FROM memories WHERE scope=?",
+                                (str(scope),)).fetchone()["c"]

awm-0.1.0/awm.egg-info/PKG-INFO

@@ -0,0 +1,58 @@
+Metadata-Version: 2.4
+Name: awm
+Version: 0.1.0
+Summary: A portable, scoped agent memory — hierarchical tenant:user:project scopes where a write lands at exactly one scope, a read includes ancestors by distance, and siblings never leak.
+License: Apache-2.0
+Project-URL: Homepage, https://github.com/Aitherium/awm
+Project-URL: Repository, https://github.com/Aitherium/awm.git
+Requires-Python: >=3.10
+Description-Content-Type: text/markdown
+License-File: LICENSE
+Provides-Extra: dev
+Requires-Dist: pytest>=7.0; extra == "dev"
+Dynamic: license-file
+
+# awm
+
+A portable, scoped agent memory. SQLite, no service, no network.
+
+```
+platform:*:*               everyone
+{tenant}:*:*               one org
+{tenant}:{user}:*          one person
+{tenant}:{user}:{project}  one piece of work
+```
+
+```bash
+pip install awm
+
+awm remember --scope acme:alice:orchestrator --key recipe --value "rank 16, lr 2e-5"
+awm recall   --scope acme:alice:orchestrator
+```
+
+## Two rules, deliberately asymmetric
+
+**A write lands at exactly one scope.** Writing "somewhere in this subtree" is
+how a memory becomes visible to a scope its author never considered.
+
+**A read includes ancestors, weighted by distance.** A project query surfaces
+the user's preferences and the platform's conventions — that is the point of a
+hierarchy — but a platform fact must not outrank a project fact just because it
+was written first.
+
+## One property that is security, not tidiness
+
+**Siblings never see each other.** `acme:alice:*` and `acme:bob:*` share an
+ancestor and nothing else. The scope check is segment-wise, never a string
+prefix, because `"acmecorp:...".startswith("acme")` is `True` — that is one
+customer's memory entering another's context, silently, with the answer still
+looking like an answer. SQL narrows by an exact computed set, never a `LIKE`.
+
+`platform` is a reserved sentinel tenant meaning "everyone", not an
+organisation. Treating it as a literal tenant name made the root of the
+hierarchy invisible from every scope — every recall still returned results, just
+never the platform's. The self-test carries that case.
+
+## Licence
+
+Apache-2.0.

awm-0.1.0/awm.egg-info/SOURCES.txt

@@ -0,0 +1,13 @@
+LICENSE
+README.md
+pyproject.toml
+awm/__init__.py
+awm/cli.py
+awm/scope.py
+awm/store.py
+awm.egg-info/PKG-INFO
+awm.egg-info/SOURCES.txt
+awm.egg-info/dependency_links.txt
+awm.egg-info/entry_points.txt
+awm.egg-info/requires.txt
+awm.egg-info/top_level.txt

awm-0.1.0/awm.egg-info/dependency_links.txt

@@ -0,0 +1 @@
+

awm-0.1.0/awm.egg-info/entry_points.txt

@@ -0,0 +1,2 @@
+[console_scripts]
+awm = awm.cli:main

awm-0.1.0/awm.egg-info/requires.txt

@@ -0,0 +1,3 @@
+
+[dev]
+pytest>=7.0

awm-0.1.0/awm.egg-info/top_level.txt

@@ -0,0 +1 @@
+awm

awm-0.1.0/pyproject.toml

@@ -0,0 +1,32 @@
+[build-system]
+requires = ["setuptools>=61.0"]
+build-backend = "setuptools.build_meta"
+
+[project]
+name = "awm"
+version = "0.1.0"
+description = "A portable, scoped agent memory — hierarchical tenant:user:project scopes where a write lands at exactly one scope, a read includes ancestors by distance, and siblings never leak."
+readme = "README.md"
+requires-python = ">=3.10"
+license = { text = "Apache-2.0" }
+# stdlib only (sqlite3, json). An agent's memory is the last thing that should
+# need a network or a service to be usable off-fleet.
+dependencies = []
+
+[project.optional-dependencies]
+dev = ["pytest>=7.0"]
+
+[project.scripts]
+awm = "awm.cli:main"
+
+[project.urls]
+Homepage = "https://github.com/Aitherium/awm"
+Repository = "https://github.com/Aitherium/awm.git"
+
+[tool.setuptools]
+packages = ["awm"]
+license-files = ["LICENSE"]
+
+[tool.ruff]
+line-length = 100
+target-version = "py310"

awm-0.1.0/setup.cfg

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