genome-memory 1.0.0__tar.gz

genome_memory-1.0.0/LICENSE

@@ -0,0 +1,201 @@
+                                 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 2026 Northtek (FrostByte Digital LLC)
+
+   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.

genome_memory-1.0.0/NOTICE

@@ -0,0 +1,7 @@
+GENOME
+Copyright 2026 Northtek (FrostByte Digital LLC)
+
+This product includes software developed by Northtek (FrostByte Digital LLC).
+
+Licensed under the Apache License, Version 2.0. See the LICENSE file for details.
+Contact: info@northtek.io

genome_memory-1.0.0/PKG-INFO

@@ -0,0 +1,307 @@
+Metadata-Version: 2.4
+Name: genome-memory
+Version: 1.0.0
+Summary: DNA-inspired memory layer for AI agents: zero-LLM-call ingestion, retrieval that beats full-context on overflowing histories.
+Author-email: Northtek <info@northtek.io>
+Maintainer-email: FrostByte Digital <info@northtek.io>
+License-Expression: Apache-2.0
+Project-URL: Homepage, https://github.com/NORTHTEKDevs/genome
+Project-URL: Repository, https://github.com/NORTHTEKDevs/genome
+Project-URL: Issues, https://github.com/NORTHTEKDevs/genome/issues
+Project-URL: Changelog, https://github.com/NORTHTEKDevs/genome/blob/main/CHANGELOG.md
+Classifier: Development Status :: 5 - Production/Stable
+Classifier: Intended Audience :: Developers
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.11
+Classifier: Programming Language :: Python :: 3.12
+Classifier: Programming Language :: Python :: 3.13
+Classifier: Operating System :: OS Independent
+Requires-Python: <3.14,>=3.11
+Description-Content-Type: text/markdown
+License-File: LICENSE
+License-File: NOTICE
+Requires-Dist: numpy<3.0,>=1.26
+Requires-Dist: sentence-transformers<4.0,>=2.7
+Requires-Dist: scikit-learn<2.0,>=1.4
+Requires-Dist: matplotlib<4.0,>=3.8
+Requires-Dist: rank-bm25>=0.2.2
+Provides-Extra: dev
+Requires-Dist: pytest>=8.0; extra == "dev"
+Requires-Dist: ruff>=0.4; extra == "dev"
+Requires-Dist: jupyter>=1.0; extra == "dev"
+Requires-Dist: pandas>=2.0; extra == "dev"
+Requires-Dist: ipykernel>=6.0; extra == "dev"
+Requires-Dist: langchain-core>=0.3; extra == "dev"
+Requires-Dist: llama-index-core>=0.10; extra == "dev"
+Requires-Dist: fastapi>=0.110; extra == "dev"
+Requires-Dist: uvicorn[standard]>=0.27; extra == "dev"
+Requires-Dist: pydantic>=2.5; extra == "dev"
+Requires-Dist: httpx>=0.27; extra == "dev"
+Provides-Extra: langchain
+Requires-Dist: langchain-core>=0.3; extra == "langchain"
+Provides-Extra: llamaindex
+Requires-Dist: llama-index-core>=0.10; extra == "llamaindex"
+Provides-Extra: postgres
+Requires-Dist: psycopg[binary]>=3.1; extra == "postgres"
+Requires-Dist: pgvector>=0.2; extra == "postgres"
+Provides-Extra: fastapi
+Requires-Dist: fastapi>=0.110; extra == "fastapi"
+Requires-Dist: uvicorn[standard]>=0.27; extra == "fastapi"
+Requires-Dist: pydantic>=2.5; extra == "fastapi"
+Provides-Extra: mcp
+Requires-Dist: mcp>=1.2; extra == "mcp"
+Provides-Extra: all
+Requires-Dist: mcp>=1.2; extra == "all"
+Requires-Dist: langchain-core>=0.3; extra == "all"
+Requires-Dist: llama-index-core>=0.10; extra == "all"
+Requires-Dist: psycopg[binary]>=3.1; extra == "all"
+Requires-Dist: pgvector>=0.2; extra == "all"
+Requires-Dist: fastapi>=0.110; extra == "all"
+Requires-Dist: uvicorn[standard]>=0.27; extra == "all"
+Requires-Dist: pydantic>=2.5; extra == "all"
+Dynamic: license-file
+
+# GENOME
+
+**Open memory for AI agents. Same answer accuracy as Mem0 — but ~1,000× cheaper to store, runs fully offline, and keeps an auditable record.**
+
+[![tests](https://github.com/NORTHTEKDevs/genome/actions/workflows/tests.yml/badge.svg)](https://github.com/NORTHTEKDevs/genome/actions/workflows/tests.yml)
+[![License: Apache 2.0](https://img.shields.io/badge/License-Apache_2.0-blue.svg)](./LICENSE)
+![Python 3.11+](https://img.shields.io/badge/python-3.11%2B-blue)
+
+Most agent-memory tools (like Mem0) call an LLM on **every message** to decide what to
+remember. That's the slow, expensive part — and GENOME's bet is that you don't need it.
+GENOME just embeds each message locally: no LLM, no API, no network in the write path.
+
+Benchmarked honestly on public datasets (LoCoMo, LongMemEval), GENOME **answers just as
+accurately as Mem0** — while storing memories for a tiny fraction of the cost and running
+completely offline.
+
+> **Honest up front:** on answer accuracy, GENOME *ties* Mem0 — we do **not** claim to beat
+> it there (two independent benchmark runs confirm parity). The advantage is cost, speed,
+> offline operation, and a temporal/auditable record Mem0 can't produce.
+
+## Add persistent memory to your agent in one line (MCP)
+
+GENOME ships a **fully-local MCP server** — cross-session memory for Claude Desktop, Claude
+Code, or Cursor with **no API key and no data leaving your machine**:
+
+```bash
+pip install "genome-memory[mcp] @ git+https://github.com/NORTHTEKDevs/genome.git"
+```
+
+```json
+{ "mcpServers": { "genome": { "command": "genome-mcp" } } }
+```
+
+Tools the agent gets: **`remember`**, **`recall`**, **`forget`**, **`reset_memories`**.
+Memories persist locally in `~/.genome/memories.db`. [Full MCP details ↓](#use-it-as-an-mcp-server-fully-local-memory-for-any-agent)
+
+## GENOME vs Mem0 at a glance
+
+| | GENOME | Mem0 |
+|---|---|---|
+| **Answer accuracy** (LoCoMo, LongMemEval) | tied | tied |
+| **LLM calls to store one message** | **0** | 1+ |
+| **Write speed** | **~10 ms** | ~2,000 ms |
+| **Runs offline / air-gapped** | **yes** | no (needs an LLM API) |
+| **Ingest cost** (10k-user deployment) | **~$190 / yr** | $159k–$1.6M / yr |
+| **"What was true in March?"** (point-in-time) | **yes** | no |
+| **Deterministic, auditable memory** | **yes** | no |
+
+Every number is measured within one harness — same responder, judge, embedder, and top-k;
+only the memory layer changes — with paired significance tests. Full detail and per-number
+provenance: [`benchmarks/RESULTS.md`](./benchmarks/RESULTS.md). Formatted report:
+[`benchmarks/GENOME-LoCoMo-Report.pdf`](./benchmarks/GENOME-LoCoMo-Report.pdf).
+
+## Why it's ~1,000× cheaper: it never calls an LLM to remember
+
+Storing one message costs **one LLM call in Mem0, zero in GENOME** (just a local embedding).
+That's not a benchmark you can argue with — it's arithmetic, and it holds no matter which
+LLM you price it against. At 10,000 users × 50 messages/day (15M messages/month):
+
+| Model Mem0 uses to extract | Mem0's yearly ingest bill | GENOME |
+|---|---|---|
+| Claude Haiku | $1,601,757 | **$190** |
+| gpt-4o-mini | $238,596 | **$190** |
+| cheapest hosted model | $159,064 | **$190** |
+
+The gap survives the cheapest model and *grows* in production (Mem0 re-sends stored memories
+to the LLM as the store fills). Reproduce: `python benchmarks/tco_project.py` (no API key).
+
+## It runs air-gapped
+
+GENOME's default embedder is local. We proved the write path is genuinely offline by
+**blocking all network during writes** — they still succeed:
+
+- **~10 ms/message, 0 network calls, 0 LLM calls** (`python benchmarks/local_writepath.py`)
+- Mem0 can't do this — it needs an LLM API call to ingest.
+
+That makes GENOME usable on-prem, in regulated environments, or fully offline. It's a yes/no
+capability, not a price point.
+
+## How it works
+
+- **Write:** embed the message locally and store it. No LLM, no network. (~10 ms)
+- **Read:** vector search over your memories, with an optional local cross-encoder reranker
+  for harder queries.
+- **Optional bi-temporal layer:** track how facts change over time and answer "what was true
+  at time T" — see below.
+
+## Install
+
+Until the PyPI release lands, install from source:
+
+```bash
+pip install "git+https://github.com/NORTHTEKDevs/genome.git"
+```
+
+(`pip install genome-memory` is coming.) The default embedder is local
+(`sentence-transformers/all-MiniLM-L6-v2`) — no API key, works offline; the first run
+downloads the ~90 MB model once. OpenAI embeddings are optional for higher-dimensional retrieval.
+
+## Quickstart (fully local, no API key)
+
+```python
+from genome import Memory
+
+mem = Memory(storage="genome.db")   # local embedder by default; ":memory:" for ephemeral
+
+# Store a message -- embedded locally, no LLM call, no network
+mem.add("Ada met Lin at the robotics summit in Berlin.", user_id="u1")
+mem.add("They are collaborating on an open-source planning library.", user_id="u1")
+
+# Retrieve the most relevant memories
+for hit in mem.search("Where did Ada meet Lin?", user_id="u1", limit=5):
+    print(f"{hit.score:.3f}  {hit.content}")
+```
+
+`Memory` mirrors Mem0's API (`add` / `search` / `get` / `delete` / `reset`) — a near
+drop-in swap. To use OpenAI embeddings instead (set `OPENAI_API_KEY`):
+
+```python
+from genome import Memory, EmbeddingProvider
+mem = Memory(storage="genome.db",
+             embedding_provider=EmbeddingProvider(model_name="openai:text-embedding-3-small"))
+```
+
+## Use it as an MCP server (fully-local memory for any agent)
+
+GENOME ships an MCP server, so any MCP client (Claude Desktop, Claude Code, Cursor, …) gets
+persistent cross-session memory that runs **entirely on the local machine** — no LLM calls,
+no API keys, no data leaves the box. Most memory MCPs can't say that.
+
+Install with the `mcp` extra, then add it to your client's config:
+
+```bash
+pip install "genome-memory[mcp] @ git+https://github.com/NORTHTEKDevs/genome.git"
+```
+
+```json
+{
+  "mcpServers": {
+    "genome": { "command": "genome-mcp" }
+  }
+}
+```
+
+Tools the agent gets: **`remember`** (store a fact/preference, local + 0 LLM), **`recall`**
+(semantic search), **`forget`** (delete the memory matching a query), **`reset_memories`**
+(clear a user's memories). Memories persist in `~/.genome/memories.db` (override with the
+`GENOME_MCP_DB` env var). Run standalone with `genome-mcp` or `python -m genome.mcp.server`.
+
+## The honest results
+
+Same responder + judge + embedder for every system; only the memory layer changes.
+
+| What we measured | Result | Verdict |
+|---|---|---|
+| Answer accuracy, in-window (LoCoMo) | GENOME 0.851 vs Mem0 0.855 (p > 0.23) | **Tied** |
+| Answer accuracy, harder bench (LongMemEval, n=90 & n=205) | directionally ahead, not significant (p = 0.14–0.19) | **Tied** |
+| Accuracy when history overflows the context window | **+0.409** at 80× less context (p = 8e-10) | **Win** |
+| Cost to store a message | 0 LLM calls vs 1+; **837–8,433× cheaper** | **Win** |
+| Write path | **~10 ms, air-gapped**, 0 network calls | **Win** |
+| Point-in-time ("what was true at T") | belief-state **0.870** vs Mem0 0.676 (synthetic data) | **Win, with caveat** |
+| Retrieval hit-rate with reranking | improves hit@10 (up to 0.943); local + free | **Win** |
+
+### What we tested that *didn't* help (so you don't have to)
+
+We publish our nulls — it's how you know the wins are real:
+- **Synthesis / consolidation:** accuracy-neutral at equal token budget (p = 0.86).
+- **Hybrid (BM25 + dense) and graph retrieval:** hybrid underperformed plain dense on LoCoMo;
+  graph was not validated here.
+- **Reranking's accuracy gain is embedder-dependent:** it reliably improves *retrieval
+  hit-rate*, but its effect on final *answer accuracy* depends on the embedder — treat it as a
+  retrieval-quality tool, not a guaranteed accuracy win.
+
+## Bi-temporal memory: "what was true at time T"
+
+GENOME can track how facts change over time and answer point-in-time questions — something
+overwrite-based memory structurally can't do (it only keeps the latest value):
+
+```python
+from genome.memory.belief import ingest_belief_turn, answer_belief_context
+
+mem = Memory(storage="genome.db", llm_call=my_llm_fn)
+
+# facts land at their DOMAIN time (parsed from the text), not wall-clock ingest time
+ingest_belief_turn(mem, "In March 2024, Jordan moved to Seattle.", session_time=t0, user_id="u")
+ingest_belief_turn(mem, "Jordan just moved to Austin.", session_time=t2, user_id="u")
+
+answer_belief_context(mem, "Where does Jordan live now?", user_id="u")            # -> Austin
+answer_belief_context(mem, "Where did Jordan live in early 2024?", user_id="u")   # -> Seattle
+answer_belief_context(mem, "List every city Jordan has lived in.", user_id="u")   # -> Seattle; Austin
+```
+
+On the TempBelief benchmark it answers as-of queries at **0.870** vs Mem0's 0.676, with the
+knowledge graph audited at 0.97 precision / 0.96 recall. **Caveat:** TempBelief is synthetic
+text with explicit dates; the edge shrinks on natural speech. Real capability, bounded proof.
+
+## Optional features
+
+Opt-in; the default path stays LLM-free and local at ingest.
+
+```python
+mem = Memory(
+    storage="genome.db",
+    llm_call=my_llm_fn,             # LLM-based fact extraction on add()
+    resolve_conflicts=True,         # ADD/UPDATE/DELETE vs existing memories
+    auto_extract_entities=True,     # entity graph for graph retrieval
+    auto_consolidate_threshold=200, # summarize-or-prune when a scope grows past N
+)
+mem.search("...", user_id="u1", mode="hybrid")   # modes: "dense" (default), "hybrid", "graph"
+```
+
+Reranking (local, free, no API):
+
+```python
+from genome.memory.rerank import CrossEncoderReranker
+mem = Memory(storage="genome.db", reranker=CrossEncoderReranker())   # lazy-loaded
+mem.search("Where did the user go on vacation?", user_id="u1", limit=5)  # reranked
+```
+
+## Reproduce the benchmarks
+
+The LoCoMo and LongMemEval datasets are **not bundled** (they carry their own licenses —
+LoCoMo is CC BY-NC 4.0). See [`benchmarks/data/README.md`](./benchmarks/data/README.md) to
+download them. The first two lines need no dataset and no API keys:
+
+```bash
+python benchmarks/local_writepath.py        # local write path: ~10ms/msg, 0 network
+python benchmarks/tco_project.py            # deployment cost projection
+python benchmarks/verdict.py                # in-window accuracy + McNemar
+python benchmarks/haystack_report.py        # overflow / context-window crossover
+python benchmarks/ingest_cost.py --n 80     # measured ingestion cost vs Mem0
+python benchmarks/lme_qa.py --n 90          # LongMemEval head-to-head vs Mem0
+python benchmarks/tempbelief_run.py --convs 6   # bi-temporal point-in-time vs baselines
+```
+
+## License
+
+**Apache License 2.0** — see [LICENSE](./LICENSE) and [NOTICE](./NOTICE).
+
+GENOME is free and open source: read it, modify it, self-host it, and embed it in your own
+applications — commercial use included — under the terms of Apache 2.0. Questions:
+info@northtek.io.
+
+Copyright 2026 Northtek (FrostByte Digital LLC).