hy-memory 2.0.1__tar.gz → 2.0.2__tar.gz
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- hy_memory-2.0.2/LICENSE +61 -0
- hy_memory-2.0.2/PKG-INFO +310 -0
- hy_memory-2.0.2/README.md +259 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/vector_store_qdrant.py +90 -17
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/models/memory.py +2 -3
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_graph/projector.py +2 -2
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/utils/async_executor.py +4 -0
- hy_memory-2.0.2/hy_memory.egg-info/PKG-INFO +310 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/pyproject.toml +2 -2
- hy_memory-2.0.1/LICENSE +0 -21
- hy_memory-2.0.1/PKG-INFO +0 -384
- hy_memory-2.0.1/README.md +0 -333
- hy_memory-2.0.1/hy_memory.egg-info/PKG-INFO +0 -384
- {hy_memory-2.0.1 → hy_memory-2.0.2}/MANIFEST.in +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/__init__.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/agent/__init__.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/agent/abstractor.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/agent/emotion_analyzer.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/agent/episode_summary.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/agent/extractor.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/agent/intention_detector.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/agent/llm_provider.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/agent/mem_agent.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/agent/prompts_zh.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/agent/reconciler.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/agent/reflector.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/agent/tools/__init__.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/agent/tools/base.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/agent/tools/basic_profile.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/client.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/coding/__init__.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/coding/chain_store.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/coding/extractor.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/coding/fact_reconciler.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/coding/judge.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/coding/lexical.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/coding/preproc.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/coding/prompts_zh.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/coding/reconciler.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/coding/store.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/coding/types.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/coding/writer.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/config.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/core/__init__.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/core/embed_service.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/core/merger.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/core/scorer.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/core/workload.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/__init__.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/cache.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/cache_base.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/cache_mysql.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/cache_sqlite.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/graph_store.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/graph_store_base.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/graph_store_kuzu.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/graph_store_neo4j.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/history_store.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/kv_store.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/rdb.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/vector_store.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/vector_store_base.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/vector_store_chroma.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/data/vector_store_faiss.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/inspector.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/metrics.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/models/__init__.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/models/requests.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/__init__.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_graph/__init__.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_graph/rerank.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_graph/topic_summary.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/__init__.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/bm25.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/bm25_fastembed.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/candidate_guards.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/config.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/date_view.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/dedup.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/diversity.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/entities.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/entity_store.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/evolution.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/hierarchy_bundle.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/intent.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/intention.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/lemmatize.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/local_rerank.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/memory_format.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/multi_seed_bundle.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/ner.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/profile_evidence.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/profile_owner_gate.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/query_expand.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/reconcile_retrieval.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/record_date_view.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/retrieval_clauses.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/rrf.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/scoring.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/series_tail_guard.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/session_episode.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/strength.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/supplemental_propositions.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/tag_index.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/temporal.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/topic_candidates.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/trace.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/underflow.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/_retrieval/user_level_l0.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/balanced_catalog.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/base.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/cross_domain_sweeper.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/reader.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/reader_base.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/reader_hybrid.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/reader_legacy.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/registry.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/specific_supplement.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/system2_agent.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/system2_tools.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/system2_writer.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/user_profile_scope.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/pipelines/writer.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/runtime.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/server.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/structure.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/utils/clone_references.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/utils/keyword_ties.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/utils/lang_detect.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/utils/log_setup.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/utils/metrics.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/utils/pipeline_log_writer.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/utils/pipeline_observability.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/utils/source_filter.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/utils/time_window.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/utils/token_count.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/utils/trace_file_writer.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory/utils/tracer.py +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory.egg-info/SOURCES.txt +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory.egg-info/dependency_links.txt +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory.egg-info/requires.txt +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/hy_memory.egg-info/top_level.txt +0 -0
- {hy_memory-2.0.1 → hy_memory-2.0.2}/setup.cfg +0 -0
hy_memory-2.0.2/LICENSE
ADDED
|
@@ -0,0 +1,61 @@
|
|
|
1
|
+
Tencent is pleased to support the community by making Hy-Memory available.
|
|
2
|
+
|
|
3
|
+
Copyright (C) 2026 Tencent. All rights reserved.
|
|
4
|
+
|
|
5
|
+
Hy-Memory is licensed under Apache-2.0. Hy-Memory does not impose any additional restrictions beyond those specified in the license.
|
|
6
|
+
|
|
7
|
+
For the avoidance of doubt, Hy-Memory refers solely to code, parameters, and weights made publicly available by Tencent in accordance with Apache-2.0.
|
|
8
|
+
|
|
9
|
+
Terms of the Apache-2.0 License:
|
|
10
|
+
--------------------------------------------------------------------
|
|
11
|
+
Apache License
|
|
12
|
+
Version 2.0, January 2004
|
|
13
|
+
http://www.apache.org/licenses/
|
|
14
|
+
|
|
15
|
+
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
|
16
|
+
|
|
17
|
+
1. Definitions.
|
|
18
|
+
|
|
19
|
+
"License" shall mean the terms and conditions for use, reproduction, and distribution as defined by Sections 1 through 9 of this document.
|
|
20
|
+
|
|
21
|
+
"Licensor" shall mean the copyright owner or entity authorized by the copyright owner that is granting the License.
|
|
22
|
+
|
|
23
|
+
"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.
|
|
24
|
+
|
|
25
|
+
"You" (or "Your") shall mean an individual or Legal Entity exercising permissions granted by this License.
|
|
26
|
+
|
|
27
|
+
"Source" form shall mean the preferred form for making modifications, including but not limited to software source code, documentation source, and configuration files.
|
|
28
|
+
|
|
29
|
+
"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.
|
|
30
|
+
|
|
31
|
+
"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).
|
|
32
|
+
|
|
33
|
+
"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.
|
|
34
|
+
|
|
35
|
+
"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."
|
|
36
|
+
|
|
37
|
+
"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.
|
|
38
|
+
|
|
39
|
+
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.
|
|
40
|
+
|
|
41
|
+
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.
|
|
42
|
+
|
|
43
|
+
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:
|
|
44
|
+
|
|
45
|
+
You must give any other recipients of the Work or Derivative Works a copy of this License; and
|
|
46
|
+
You must cause any modified files to carry prominent notices stating that You changed the files; and
|
|
47
|
+
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
|
|
48
|
+
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.
|
|
49
|
+
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.
|
|
50
|
+
|
|
51
|
+
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.
|
|
52
|
+
|
|
53
|
+
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.
|
|
54
|
+
|
|
55
|
+
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.
|
|
56
|
+
|
|
57
|
+
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.
|
|
58
|
+
|
|
59
|
+
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.
|
|
60
|
+
|
|
61
|
+
END OF TERMS AND CONDITIONS
|
hy_memory-2.0.2/PKG-INFO
ADDED
|
@@ -0,0 +1,310 @@
|
|
|
1
|
+
Metadata-Version: 2.4
|
|
2
|
+
Name: hy-memory
|
|
3
|
+
Version: 2.0.2
|
|
4
|
+
Summary: HY Memory - Industrial-grade dual-system cognitive memory framework
|
|
5
|
+
Author: alvinfei
|
|
6
|
+
License-Expression: Apache-2.0
|
|
7
|
+
Requires-Python: >=3.9
|
|
8
|
+
Description-Content-Type: text/markdown
|
|
9
|
+
License-File: LICENSE
|
|
10
|
+
Requires-Dist: pydantic
|
|
11
|
+
Requires-Dist: numpy
|
|
12
|
+
Requires-Dist: openai<3,>=1.40
|
|
13
|
+
Requires-Dist: python-dotenv
|
|
14
|
+
Requires-Dist: pyyaml
|
|
15
|
+
Requires-Dist: chromadb>=1.5.9
|
|
16
|
+
Requires-Dist: kuzu
|
|
17
|
+
Requires-Dist: langdetect
|
|
18
|
+
Requires-Dist: scikit-learn
|
|
19
|
+
Requires-Dist: tiktoken
|
|
20
|
+
Requires-Dist: json-repair
|
|
21
|
+
Requires-Dist: rank-bm25
|
|
22
|
+
Requires-Dist: jieba
|
|
23
|
+
Provides-Extra: qdrant
|
|
24
|
+
Requires-Dist: qdrant-client; extra == "qdrant"
|
|
25
|
+
Requires-Dist: fastembed; extra == "qdrant"
|
|
26
|
+
Provides-Extra: faiss
|
|
27
|
+
Requires-Dist: faiss-cpu; extra == "faiss"
|
|
28
|
+
Provides-Extra: graph
|
|
29
|
+
Requires-Dist: neo4j; extra == "graph"
|
|
30
|
+
Provides-Extra: mysql
|
|
31
|
+
Requires-Dist: aiomysql; extra == "mysql"
|
|
32
|
+
Provides-Extra: rerank
|
|
33
|
+
Requires-Dist: torch; extra == "rerank"
|
|
34
|
+
Requires-Dist: transformers; extra == "rerank"
|
|
35
|
+
Provides-Extra: all
|
|
36
|
+
Requires-Dist: chromadb>=1.5.9; extra == "all"
|
|
37
|
+
Requires-Dist: qdrant-client; extra == "all"
|
|
38
|
+
Requires-Dist: fastembed; extra == "all"
|
|
39
|
+
Requires-Dist: faiss-cpu; extra == "all"
|
|
40
|
+
Requires-Dist: kuzu; extra == "all"
|
|
41
|
+
Requires-Dist: neo4j; extra == "all"
|
|
42
|
+
Requires-Dist: aiomysql; extra == "all"
|
|
43
|
+
Requires-Dist: torch; extra == "all"
|
|
44
|
+
Requires-Dist: transformers; extra == "all"
|
|
45
|
+
Provides-Extra: dev
|
|
46
|
+
Requires-Dist: pytest; extra == "dev"
|
|
47
|
+
Requires-Dist: pytest-asyncio; extra == "dev"
|
|
48
|
+
Requires-Dist: httpx; extra == "dev"
|
|
49
|
+
Requires-Dist: ruff; extra == "dev"
|
|
50
|
+
Dynamic: license-file
|
|
51
|
+
|
|
52
|
+
<p align="center">
|
|
53
|
+
<img src="docs/images/hunyuanlogo.png" alt="Tencent Hunyuan" width="260">
|
|
54
|
+
</p>
|
|
55
|
+
|
|
56
|
+
<h1 align="center">Hy Memory</h1>
|
|
57
|
+
|
|
58
|
+
<p align="center">Production-grade dual-system cognitive memory for LLM agents.</p>
|
|
59
|
+
|
|
60
|
+
<p align="center">
|
|
61
|
+
<a href="#latest-news"><img src="https://img.shields.io/badge/news-latest-e65100?style=flat-square" alt="Latest News"></a>
|
|
62
|
+
<a href="#papers"><img src="https://img.shields.io/badge/papers-research-68448b?style=flat-square" alt="Papers"></a>
|
|
63
|
+
<a href="#quick-start"><img src="https://img.shields.io/badge/get_started-quickstart-149954?style=flat-square" alt="Get Started"></a>
|
|
64
|
+
<a href="#system-architecture"><img src="https://img.shields.io/badge/architecture-overview-007ec6?style=flat-square" alt="System Architecture"></a>
|
|
65
|
+
<a href="#support"><img src="https://img.shields.io/badge/support-docs-00897b?style=flat-square" alt="Support"></a>
|
|
66
|
+
<a href="https://huggingface.co/tencent/Hy-Memory-30B-A3B"><img src="https://img.shields.io/badge/model-Hugging%20Face-ffd21e?style=flat-square" alt="Hugging Face Model"></a>
|
|
67
|
+
<a href="memhub/README.md"><img src="https://img.shields.io/badge/MemHub-README-f28c45?style=flat-square" alt="MemHub"></a>
|
|
68
|
+
<a href="https://memory.hunyuan.tencent.com/"><img src="https://img.shields.io/badge/website-Hy%20Memory-0052d9?style=flat-square" alt="Website"></a>
|
|
69
|
+
<a href="https://discord.gg/x56wEb2PX"><img src="https://img.shields.io/badge/Discord-memory%20channel-5865f2?style=flat-square&logo=discord&logoColor=white" alt="Discord"></a>
|
|
70
|
+
<a href="LICENSE"><img src="https://img.shields.io/badge/license-Apache--2.0-4c6ef5?style=flat-square" alt="Apache-2.0 License"></a>
|
|
71
|
+
</p>
|
|
72
|
+
|
|
73
|
+
English | [中文](README.zh.md)
|
|
74
|
+
|
|
75
|
+
**[Hy Memory](https://memory.hunyuan.tencent.com/)** ([Official Website](https://memory.hunyuan.tencent.com/)) is a production-grade dual-system cognitive memory engine and Python SDK (`hy-memory`) for self-evolving LLM agents, providing specialized memory pipelines across three task scenes: hierarchical long-term cognitive memory for **Chat**, two-layer fact and reusable-experience memory for **Working**, and version-evolution diff-chain tracking for **Coding**. Built on top of Hy Memory, **[MemHub](memhub/README.md)** is a local-first desktop and CLI product that unifies conversation history and coding traces from user-authorized AI applications (such as Claude Code, Cursor, Codex, OpenCode, and Qwen Code) into a single managed runtime and local data directory, enabling governed cross-application memory recall.
|
|
76
|
+
|
|
77
|
+
<div align="center">
|
|
78
|
+
<video src="https://github.com/user-attachments/assets/94405890-8429-47c2-9084-38f7ed9f126f" controls width="640"></video>
|
|
79
|
+
<p><b>MemHub Demo Video</b></p>
|
|
80
|
+
</div>
|
|
81
|
+
|
|
82
|
+
---
|
|
83
|
+
|
|
84
|
+
## Latest News
|
|
85
|
+
|
|
86
|
+
* *<mark>[new]</mark>* 🔥🔥🔥 **[2026-10]**: 🚀 **Released** **Hy Memory 2.0 (`hy-memory==2.0.1`)** on [PyPI](https://pypi.org/project/hy-memory/2.0.1/) and open-sourced the **Hy-Memory** monorepo together with **[MemHub](memhub/README.md)**!
|
|
87
|
+
* *<mark>[new]</mark>* 🔥🔥🔥 **[2026-10]**: 🚀 **Open-sourced** **[Hy-Memory-30B-A3B](https://huggingface.co/tencent/Hy-Memory-30B-A3B)** on Hugging Face along with its [technical report](https://arxiv.org/abs/2610.22196) on attributed reinforcement learning for long-term memory writing!
|
|
88
|
+
* *<mark>[new]</mark>* 🔥🔥 **[2026-09]**: 📊 **Released** **[CMB: A Coding Memory Benchmark for Long-Horizon and Interleaved Coding Agents](docs/papers/CMB_A_Coding_Memory_Benchmark_for_Long_Horizon_and_Interleaved_Coding_Agents.pdf)** (submitted to **ICLR 2027**).
|
|
89
|
+
* *<mark>[new]</mark>* 🔥🔥 **[2026-08]**: 🎉 **Accepted** at **EMNLP 2026**: **[Memory Beyond Recall: A Dual-Process Cognitive Memory System for Self-Evolving LLM Agents](https://arxiv.org/abs/2606.09483)**!
|
|
90
|
+
* 🔥 **[2026-05]**: 🌟 **Initial Release** Released **[Hy Memory 1.0](https://mp.weixin.qq.com/s/dH5PGpxqArFZkSq3-QxWYA)**, our first-generation dual-system cognitive memory framework for self-evolving LLM agents.
|
|
91
|
+
|
|
92
|
+
---
|
|
93
|
+
|
|
94
|
+
## Papers
|
|
95
|
+
|
|
96
|
+
Welcome to the **Hy Memory Research Family**, covering cognitive chat memory, long-horizon coding memory, and RL-trained memory writing models:
|
|
97
|
+
|
|
98
|
+
> [**Memory Beyond Recall: A Dual-Process Cognitive Memory System for Self-Evolving LLM Agents**](https://arxiv.org/abs/2606.09483) *(Accepted at **EMNLP 2026**)*
|
|
99
|
+
> **TL;DR:** Proposes the dual-process (System 1 + System 2) cognitive memory architecture for **Chat**, organizing personal memory into an 8-layer hierarchy (raw dialogues, atomic facts, summaries, schemas, and prospective intentions) with conflict reconciliation and cross-domain schema induction.
|
|
100
|
+
> 📄 Paper: https://arxiv.org/abs/2606.09483
|
|
101
|
+
|
|
102
|
+
> [**CMB: A Coding Memory Benchmark for Long-Horizon and Interleaved Coding Agents**](docs/papers/CMB_A_Coding_Memory_Benchmark_for_Long_Horizon_and_Interleaved_Coding_Agents.pdf) *(Submitted to **ICLR 2027**)*
|
|
103
|
+
> **TL;DR:** Introduces a benchmark and two-layer + version-evolution diff-chain memory method for long-horizon **Coding** agents, preserving both reusable engineering experiences and exact code revision trajectories across interleaved tasks.
|
|
104
|
+
> 📄 Paper: [docs/papers/CMB_A_Coding_Memory_Benchmark_for_Long_Horizon_and_Interleaved_Coding_Agents.pdf](docs/papers/CMB_A_Coding_Memory_Benchmark_for_Long_Horizon_and_Interleaved_Coding_Agents.pdf)
|
|
105
|
+
|
|
106
|
+
> [**Hy-Memory-30B-A3B: Attributed Reinforcement Learning for Long-Term Memory Writing**](https://arxiv.org/abs/2610.22196) *(Open Model Technical Report)*
|
|
107
|
+
> **TL;DR:** Trains a 30B-A3B MoE model via attributed reinforcement learning specifically for high-precision long-term memory extraction and conflict reconciliation.
|
|
108
|
+
> 📄 Paper: https://arxiv.org/abs/2610.22196 · Model: https://huggingface.co/tencent/Hy-Memory-30B-A3B
|
|
109
|
+
|
|
110
|
+
---
|
|
111
|
+
|
|
112
|
+
## Quick Start
|
|
113
|
+
|
|
114
|
+
### 1. Installation
|
|
115
|
+
|
|
116
|
+
```bash
|
|
117
|
+
pip install hy-memory==2.0.1 # core (includes ChromaDB and Kuzu)
|
|
118
|
+
pip install "hy-memory[qdrant]==2.0.1" # + Qdrant
|
|
119
|
+
pip install "hy-memory[faiss]==2.0.1" # + FAISS
|
|
120
|
+
pip install "hy-memory[graph]==2.0.1" # + Neo4j
|
|
121
|
+
pip install "hy-memory[mysql]==2.0.1" # + MySQL cache
|
|
122
|
+
pip install "hy-memory[rerank]==2.0.1" # + local multilingual cross-encoder rerank
|
|
123
|
+
pip install "hy-memory[all]==2.0.1" # everything
|
|
124
|
+
```
|
|
125
|
+
|
|
126
|
+
### 2. Configuration
|
|
127
|
+
|
|
128
|
+
Only an LLM and an embedding endpoint are needed; any OpenAI-compatible service works:
|
|
129
|
+
|
|
130
|
+
```bash
|
|
131
|
+
export MEMORY_LLM_API_KEY="sk-your-key"
|
|
132
|
+
export MEMORY_LLM_BASE_URL="https://api.deepseek.com"
|
|
133
|
+
export MEMORY_LLM_MODEL="deepseek-chat"
|
|
134
|
+
|
|
135
|
+
export MEMORY_EMBEDDER_API_KEY="sk-your-key"
|
|
136
|
+
export MEMORY_EMBEDDER_BASE_URL="https://dashscope.aliyuncs.com/compatible-mode/v1"
|
|
137
|
+
export MEMORY_EMBEDDER_MODEL="text-embedding-v3"
|
|
138
|
+
export MEMORY_EMBEDDING_DIMS=1024
|
|
139
|
+
```
|
|
140
|
+
|
|
141
|
+
Or use the OpenAI defaults with a single key:
|
|
142
|
+
|
|
143
|
+
```bash
|
|
144
|
+
export OPENAI_API_KEY="sk-your-key"
|
|
145
|
+
```
|
|
146
|
+
|
|
147
|
+
See the [Environment Variable Reference](docs/env_reference.md) for the full list.
|
|
148
|
+
|
|
149
|
+
### 3. Chat Memory
|
|
150
|
+
|
|
151
|
+
```python
|
|
152
|
+
from hy_memory import HyMemoryClient
|
|
153
|
+
|
|
154
|
+
client = HyMemoryClient(mode="pro")
|
|
155
|
+
|
|
156
|
+
# Write: plain text or OpenAI-format messages
|
|
157
|
+
client.add("I love sci-fi movies, especially Interstellar", user_id="user_1")
|
|
158
|
+
client.add([
|
|
159
|
+
{"role": "user", "content": "Recommend a movie"},
|
|
160
|
+
{"role": "assistant", "content": "Try Interstellar — a sci-fi masterpiece by Nolan"},
|
|
161
|
+
], user_id="user_1")
|
|
162
|
+
|
|
163
|
+
# Search: returns the profile / normal / proactive channels
|
|
164
|
+
results = client.search("What movies does the user like?", user_ids=["user_1"], limit=10)
|
|
165
|
+
for mem in results["memories"]["normal"]:
|
|
166
|
+
print(f" [{mem['score']:.2f}] {mem['content']}")
|
|
167
|
+
|
|
168
|
+
client.close()
|
|
169
|
+
```
|
|
170
|
+
|
|
171
|
+
### 4. Working & Coding Memory
|
|
172
|
+
|
|
173
|
+
Writes must include a tool-call trace (`tool_calls` or `role="tool"` messages) and take effect in `pro` / `ultra` mode only (`lite` ignores `scene` and stores everything as raw memory):
|
|
174
|
+
|
|
175
|
+
```python
|
|
176
|
+
messages = [
|
|
177
|
+
{"role": "user", "content": "Fix the timeout in the search client."},
|
|
178
|
+
{"role": "assistant", "content": "", "tool_calls": [{
|
|
179
|
+
"id": "call_1", "type": "function",
|
|
180
|
+
"function": {"name": "apply_patch", "arguments": '{"path":"src/search.py"}'},
|
|
181
|
+
}]},
|
|
182
|
+
{"role": "tool", "tool_call_id": "call_1", "name": "apply_patch",
|
|
183
|
+
"content": "Patch applied successfully"},
|
|
184
|
+
]
|
|
185
|
+
|
|
186
|
+
client.add(
|
|
187
|
+
messages,
|
|
188
|
+
scene="coding", # or "working"
|
|
189
|
+
user_id="user_123",
|
|
190
|
+
workspace_id="github.com/example/service", # optional: isolate by repository / project
|
|
191
|
+
branch="fix/search-timeout", # optional: requires workspace_id
|
|
192
|
+
)
|
|
193
|
+
|
|
194
|
+
result = client.search(
|
|
195
|
+
"Which timeout implementation was finally kept?",
|
|
196
|
+
scene="coding",
|
|
197
|
+
user_ids=["user_123"],
|
|
198
|
+
workspace_id="github.com/example/service",
|
|
199
|
+
branch="fix/search-timeout",
|
|
200
|
+
limit=5,
|
|
201
|
+
)
|
|
202
|
+
|
|
203
|
+
result["facts"] # fact layer
|
|
204
|
+
result["experiences"] # experience layer
|
|
205
|
+
result["chain_block"] # coding only: version-evolution context
|
|
206
|
+
```
|
|
207
|
+
|
|
208
|
+
### 5. Routing, Source Isolation & Advanced APIs
|
|
209
|
+
|
|
210
|
+
- **Automatic scene routing**: When `scene` is omitted, writes without tool calls go straight to `chat` (zero LLM calls), and writes with tool calls are classified once into `chat` / `working` / `coding`. For searches, `search_mode="default"` goes to `chat` with zero LLM calls, while `search_mode="agentic"` performs scene classification, query rewriting, and time-range parsing. See [Working/Coding Scenes](docs/scene_coding_usage.md).
|
|
211
|
+
- **Separate memories by source**: Pass `source="openclaw" | "cursor" | "codex"` on `add()` and filter with `include_sources` / `exclude_sources` on `search()` to isolate caller applications independently of `agent_id`.
|
|
212
|
+
- **CRUD & System 2 evolution**: `client.get(id)`, `client.update(id, text)`, `client.delete(id)`, `client.list_memories(user_id=...)`, and `client.evolve(user_id=...)` (triggers System 2 in `ultra` mode).
|
|
213
|
+
- **Per-call embedding endpoint override**: Pass `embed_override={"base_url": ..., "api_key": ...}` to `add()` / `search()` or use `with embed_endpoint_override(...):` for concurrency-safe endpoint switching.
|
|
214
|
+
|
|
215
|
+
For provider configuration, storage backends, scenes, and the complete API, see the [Usage Guide](docs/usage.md).
|
|
216
|
+
|
|
217
|
+
---
|
|
218
|
+
|
|
219
|
+
## System Architecture
|
|
220
|
+
|
|
221
|
+
<div align="center">
|
|
222
|
+
<img src="docs/images/architecture.svg" alt="Hy Memory architecture" width="95%">
|
|
223
|
+
</div>
|
|
224
|
+
|
|
225
|
+
Hy Memory provides three memory scenes (`scene`), one per kind of task. `add()` / `search()` go through the scene router first, then into the Chat or the Working / Coding pipeline (orange parts in the diagram are coding-only; without them the pipeline is Working):
|
|
226
|
+
|
|
227
|
+
| `scene` | Tasks | Memory shape |
|
|
228
|
+
|---|---|---|
|
|
229
|
+
| `chat` | Small talk, personal information, preferences, general Q&A | Hierarchical memory (L0–L7) |
|
|
230
|
+
| `working` | Productivity work: documents, spreadsheets, research, financial analysis, content creation, computer operation | Two-layer memory: session facts + reusable experiences |
|
|
231
|
+
| `coding` | Software engineering: coding, debugging, testing, builds, APIs/SDKs, scripts, SQL | The same two-layer memory as `working`, plus a code version-evolution chain (diff chain) |
|
|
232
|
+
|
|
233
|
+
### 1. Chat: Memory Hierarchy
|
|
234
|
+
|
|
235
|
+
For long-term personal memory. Raw conversations are abstracted layer by layer into facts, summaries, a profile, and higher-level cognitive structures:
|
|
236
|
+
|
|
237
|
+
| Layer | Name | Content |
|
|
238
|
+
|---|---|---|
|
|
239
|
+
| L0 | `BASIC_INFO` | Basic information |
|
|
240
|
+
| L1 | `RAW` | Raw conversation (append-only) |
|
|
241
|
+
| L2 | `FACT` | Atomic facts (versioned, immutable records) |
|
|
242
|
+
| L3 | `SUMMARY` | Session summaries |
|
|
243
|
+
| L4 | `IDENTITY` | Reserved |
|
|
244
|
+
| L5 | `KNOWLEDGE` | Reserved |
|
|
245
|
+
| L6 | `SCHEMA` | Mental models (abstract narrative templates, graph layer) |
|
|
246
|
+
| L7 | `INTENTION` | Prospective intentions (with an expiry; demoted to ordinary facts once expired) |
|
|
247
|
+
|
|
248
|
+
**Modes**
|
|
249
|
+
|
|
250
|
+
| Mode | What it does | Graph DB | Use case |
|
|
251
|
+
|------|--------------|----------|----------|
|
|
252
|
+
| `lite` | Raw-only embedding writes and searches, no LLM calls; `scene` and `layers` are ignored | No | Vanilla vector RAG, fast ingestion, zero LLM cost |
|
|
253
|
+
| `pro` | + LLM extraction + reconcile | Optional (`MEMORY_ENABLE_GRAPH`, off by default) | Standard workloads |
|
|
254
|
+
| `ultra` | + System 2 schema induction + cross-domain sweeper (triggered by `evolve()`) | Yes (always on) | Full cognitive architecture |
|
|
255
|
+
|
|
256
|
+
### 2. Working: Two-Layer Productivity Memory
|
|
257
|
+
|
|
258
|
+
For getting things done. One session with tool calls (a trace) produces both layers at once:
|
|
259
|
+
|
|
260
|
+
| Layer | What it records | Per session | Structure |
|
|
261
|
+
|---|---|---|---|
|
|
262
|
+
| **Facts** (`WorkingFact`) | What this session did: the task, the approach, the result | Exactly 1, no threshold | `statement`, `subject`, `files`, `details` (verbatim source) |
|
|
263
|
+
| **Experiences** | Approaches that can be reused next time a similar task comes up | 0–N, must pass a value threshold | `task`, `search_keys`, `solution`, `boundary_envs`, `confidence` |
|
|
264
|
+
|
|
265
|
+
The fact layer guarantees that work which was done is remembered; the experience layer makes what was learned reusable. The two layers link to each other (`fact.derived_experience_ids` ↔ `experience.source_fact_ids`), and superseded facts stay traceable through a task-progress chain (`fact_chain_summary`).
|
|
266
|
+
|
|
267
|
+
### 3. Coding: Two-Layer Memory + Version-Evolution Chain
|
|
268
|
+
|
|
269
|
+
Coding **reuses the same two-layer pipeline and data schema** as Working. It differs in three ways:
|
|
270
|
+
|
|
271
|
+
| | Working | Coding |
|
|
272
|
+
|---|---|---|
|
|
273
|
+
| **Extraction spec** | Productivity-task spec | Software-engineering spec: the subject must be code or a decision; record exact coordinates (file / function / branch) instead of pasting code |
|
|
274
|
+
| **Storage** | `coding_memory.db` + `*_coding_keys` / `*_working_facts` collections | `coding_memory_cv.db` + `*_cv` collections, fully isolated from working |
|
|
275
|
+
| **Version-evolution chain** | None | **Yes**: how many times the same code was changed, and what each change was |
|
|
276
|
+
|
|
277
|
+
**Why a version-evolution chain**: fact extraction deliberately avoids pasting code (the budget goes to more informative coordinates), so a version that was later reverted never appears in a fact.
|
|
278
|
+
That version is usually not in the working tree or at HEAD either, so it cannot be read back afterwards. The chain stores the real diff of every version with zero LLM calls, filling in exactly the information a summary inevitably drops.
|
|
279
|
+
|
|
280
|
+
**Design highlights** (`hy_memory/coding/chain_store.py`):
|
|
281
|
+
|
|
282
|
+
- **A decorator, not a retriever**: the vector layer decides which facts are returned; the chain only attaches, under each fact, every revision of the code it touches (the user's words for that revision + the real diff).
|
|
283
|
+
- **Change sources**: local Git diffs (set `MEMORY_CODING_CHAIN_REPO_ROOT`), or deterministic replace actions with `path` / `old` / `new` in the tool trace.
|
|
284
|
+
- **Chain granularity & isolation**: one thread corresponds to one block of one function in one file on one branch, isolated by `user_id` + `workspace_id`.
|
|
285
|
+
|
|
286
|
+
---
|
|
287
|
+
|
|
288
|
+
## Support
|
|
289
|
+
|
|
290
|
+
### Storage Backends
|
|
291
|
+
|
|
292
|
+
- Vector stores: ChromaDB (default), Qdrant, FAISS
|
|
293
|
+
- Graph stores (ultra mode): Kuzu (default), Neo4j
|
|
294
|
+
- Working / Coding metadata: local SQLite
|
|
295
|
+
|
|
296
|
+
### Documentation
|
|
297
|
+
|
|
298
|
+
- [Usage guide](docs/usage.md) — full configuration reference, API details, deployment modes
|
|
299
|
+
- [Environment variables](docs/env_reference.md) — settings and defaults
|
|
300
|
+
- [Search and Reader guide](docs/hy_memory_search_skill.md) — reader selection, schema quotas, rerank, and return channels
|
|
301
|
+
- [Working/Coding Scenes](docs/scene_coding_usage.md) — productivity-memory routing, response shapes, and coding chain behavior
|
|
302
|
+
- [Graph memory design](docs/pro_graph_design.md) — graph projection, rerank, relation paths, and deployment limits
|
|
303
|
+
- [Environment template](.env.example) — a copy-ready configuration template
|
|
304
|
+
- [MemHub README](memhub/README.md) — local-first desktop & CLI product overview, runtime commands, and privacy boundaries
|
|
305
|
+
- [OpenClaw plugin](plugins/openclaw/README.md) — agent integrations live under `plugins/` (overview: [plugins/README.md](plugins/README.md))
|
|
306
|
+
|
|
307
|
+
### License
|
|
308
|
+
|
|
309
|
+
Hy-Memory is licensed under Apache-2.0. See [LICENSE](LICENSE); third-party
|
|
310
|
+
components remain subject to their respective licenses and notices.
|
|
@@ -0,0 +1,259 @@
|
|
|
1
|
+
<p align="center">
|
|
2
|
+
<img src="docs/images/hunyuanlogo.png" alt="Tencent Hunyuan" width="260">
|
|
3
|
+
</p>
|
|
4
|
+
|
|
5
|
+
<h1 align="center">Hy Memory</h1>
|
|
6
|
+
|
|
7
|
+
<p align="center">Production-grade dual-system cognitive memory for LLM agents.</p>
|
|
8
|
+
|
|
9
|
+
<p align="center">
|
|
10
|
+
<a href="#latest-news"><img src="https://img.shields.io/badge/news-latest-e65100?style=flat-square" alt="Latest News"></a>
|
|
11
|
+
<a href="#papers"><img src="https://img.shields.io/badge/papers-research-68448b?style=flat-square" alt="Papers"></a>
|
|
12
|
+
<a href="#quick-start"><img src="https://img.shields.io/badge/get_started-quickstart-149954?style=flat-square" alt="Get Started"></a>
|
|
13
|
+
<a href="#system-architecture"><img src="https://img.shields.io/badge/architecture-overview-007ec6?style=flat-square" alt="System Architecture"></a>
|
|
14
|
+
<a href="#support"><img src="https://img.shields.io/badge/support-docs-00897b?style=flat-square" alt="Support"></a>
|
|
15
|
+
<a href="https://huggingface.co/tencent/Hy-Memory-30B-A3B"><img src="https://img.shields.io/badge/model-Hugging%20Face-ffd21e?style=flat-square" alt="Hugging Face Model"></a>
|
|
16
|
+
<a href="memhub/README.md"><img src="https://img.shields.io/badge/MemHub-README-f28c45?style=flat-square" alt="MemHub"></a>
|
|
17
|
+
<a href="https://memory.hunyuan.tencent.com/"><img src="https://img.shields.io/badge/website-Hy%20Memory-0052d9?style=flat-square" alt="Website"></a>
|
|
18
|
+
<a href="https://discord.gg/x56wEb2PX"><img src="https://img.shields.io/badge/Discord-memory%20channel-5865f2?style=flat-square&logo=discord&logoColor=white" alt="Discord"></a>
|
|
19
|
+
<a href="LICENSE"><img src="https://img.shields.io/badge/license-Apache--2.0-4c6ef5?style=flat-square" alt="Apache-2.0 License"></a>
|
|
20
|
+
</p>
|
|
21
|
+
|
|
22
|
+
English | [中文](README.zh.md)
|
|
23
|
+
|
|
24
|
+
**[Hy Memory](https://memory.hunyuan.tencent.com/)** ([Official Website](https://memory.hunyuan.tencent.com/)) is a production-grade dual-system cognitive memory engine and Python SDK (`hy-memory`) for self-evolving LLM agents, providing specialized memory pipelines across three task scenes: hierarchical long-term cognitive memory for **Chat**, two-layer fact and reusable-experience memory for **Working**, and version-evolution diff-chain tracking for **Coding**. Built on top of Hy Memory, **[MemHub](memhub/README.md)** is a local-first desktop and CLI product that unifies conversation history and coding traces from user-authorized AI applications (such as Claude Code, Cursor, Codex, OpenCode, and Qwen Code) into a single managed runtime and local data directory, enabling governed cross-application memory recall.
|
|
25
|
+
|
|
26
|
+
<div align="center">
|
|
27
|
+
<video src="https://github.com/user-attachments/assets/94405890-8429-47c2-9084-38f7ed9f126f" controls width="640"></video>
|
|
28
|
+
<p><b>MemHub Demo Video</b></p>
|
|
29
|
+
</div>
|
|
30
|
+
|
|
31
|
+
---
|
|
32
|
+
|
|
33
|
+
## Latest News
|
|
34
|
+
|
|
35
|
+
* *<mark>[new]</mark>* 🔥🔥🔥 **[2026-10]**: 🚀 **Released** **Hy Memory 2.0 (`hy-memory==2.0.1`)** on [PyPI](https://pypi.org/project/hy-memory/2.0.1/) and open-sourced the **Hy-Memory** monorepo together with **[MemHub](memhub/README.md)**!
|
|
36
|
+
* *<mark>[new]</mark>* 🔥🔥🔥 **[2026-10]**: 🚀 **Open-sourced** **[Hy-Memory-30B-A3B](https://huggingface.co/tencent/Hy-Memory-30B-A3B)** on Hugging Face along with its [technical report](https://arxiv.org/abs/2610.22196) on attributed reinforcement learning for long-term memory writing!
|
|
37
|
+
* *<mark>[new]</mark>* 🔥🔥 **[2026-09]**: 📊 **Released** **[CMB: A Coding Memory Benchmark for Long-Horizon and Interleaved Coding Agents](docs/papers/CMB_A_Coding_Memory_Benchmark_for_Long_Horizon_and_Interleaved_Coding_Agents.pdf)** (submitted to **ICLR 2027**).
|
|
38
|
+
* *<mark>[new]</mark>* 🔥🔥 **[2026-08]**: 🎉 **Accepted** at **EMNLP 2026**: **[Memory Beyond Recall: A Dual-Process Cognitive Memory System for Self-Evolving LLM Agents](https://arxiv.org/abs/2606.09483)**!
|
|
39
|
+
* 🔥 **[2026-05]**: 🌟 **Initial Release** Released **[Hy Memory 1.0](https://mp.weixin.qq.com/s/dH5PGpxqArFZkSq3-QxWYA)**, our first-generation dual-system cognitive memory framework for self-evolving LLM agents.
|
|
40
|
+
|
|
41
|
+
---
|
|
42
|
+
|
|
43
|
+
## Papers
|
|
44
|
+
|
|
45
|
+
Welcome to the **Hy Memory Research Family**, covering cognitive chat memory, long-horizon coding memory, and RL-trained memory writing models:
|
|
46
|
+
|
|
47
|
+
> [**Memory Beyond Recall: A Dual-Process Cognitive Memory System for Self-Evolving LLM Agents**](https://arxiv.org/abs/2606.09483) *(Accepted at **EMNLP 2026**)*
|
|
48
|
+
> **TL;DR:** Proposes the dual-process (System 1 + System 2) cognitive memory architecture for **Chat**, organizing personal memory into an 8-layer hierarchy (raw dialogues, atomic facts, summaries, schemas, and prospective intentions) with conflict reconciliation and cross-domain schema induction.
|
|
49
|
+
> 📄 Paper: https://arxiv.org/abs/2606.09483
|
|
50
|
+
|
|
51
|
+
> [**CMB: A Coding Memory Benchmark for Long-Horizon and Interleaved Coding Agents**](docs/papers/CMB_A_Coding_Memory_Benchmark_for_Long_Horizon_and_Interleaved_Coding_Agents.pdf) *(Submitted to **ICLR 2027**)*
|
|
52
|
+
> **TL;DR:** Introduces a benchmark and two-layer + version-evolution diff-chain memory method for long-horizon **Coding** agents, preserving both reusable engineering experiences and exact code revision trajectories across interleaved tasks.
|
|
53
|
+
> 📄 Paper: [docs/papers/CMB_A_Coding_Memory_Benchmark_for_Long_Horizon_and_Interleaved_Coding_Agents.pdf](docs/papers/CMB_A_Coding_Memory_Benchmark_for_Long_Horizon_and_Interleaved_Coding_Agents.pdf)
|
|
54
|
+
|
|
55
|
+
> [**Hy-Memory-30B-A3B: Attributed Reinforcement Learning for Long-Term Memory Writing**](https://arxiv.org/abs/2610.22196) *(Open Model Technical Report)*
|
|
56
|
+
> **TL;DR:** Trains a 30B-A3B MoE model via attributed reinforcement learning specifically for high-precision long-term memory extraction and conflict reconciliation.
|
|
57
|
+
> 📄 Paper: https://arxiv.org/abs/2610.22196 · Model: https://huggingface.co/tencent/Hy-Memory-30B-A3B
|
|
58
|
+
|
|
59
|
+
---
|
|
60
|
+
|
|
61
|
+
## Quick Start
|
|
62
|
+
|
|
63
|
+
### 1. Installation
|
|
64
|
+
|
|
65
|
+
```bash
|
|
66
|
+
pip install hy-memory==2.0.1 # core (includes ChromaDB and Kuzu)
|
|
67
|
+
pip install "hy-memory[qdrant]==2.0.1" # + Qdrant
|
|
68
|
+
pip install "hy-memory[faiss]==2.0.1" # + FAISS
|
|
69
|
+
pip install "hy-memory[graph]==2.0.1" # + Neo4j
|
|
70
|
+
pip install "hy-memory[mysql]==2.0.1" # + MySQL cache
|
|
71
|
+
pip install "hy-memory[rerank]==2.0.1" # + local multilingual cross-encoder rerank
|
|
72
|
+
pip install "hy-memory[all]==2.0.1" # everything
|
|
73
|
+
```
|
|
74
|
+
|
|
75
|
+
### 2. Configuration
|
|
76
|
+
|
|
77
|
+
Only an LLM and an embedding endpoint are needed; any OpenAI-compatible service works:
|
|
78
|
+
|
|
79
|
+
```bash
|
|
80
|
+
export MEMORY_LLM_API_KEY="sk-your-key"
|
|
81
|
+
export MEMORY_LLM_BASE_URL="https://api.deepseek.com"
|
|
82
|
+
export MEMORY_LLM_MODEL="deepseek-chat"
|
|
83
|
+
|
|
84
|
+
export MEMORY_EMBEDDER_API_KEY="sk-your-key"
|
|
85
|
+
export MEMORY_EMBEDDER_BASE_URL="https://dashscope.aliyuncs.com/compatible-mode/v1"
|
|
86
|
+
export MEMORY_EMBEDDER_MODEL="text-embedding-v3"
|
|
87
|
+
export MEMORY_EMBEDDING_DIMS=1024
|
|
88
|
+
```
|
|
89
|
+
|
|
90
|
+
Or use the OpenAI defaults with a single key:
|
|
91
|
+
|
|
92
|
+
```bash
|
|
93
|
+
export OPENAI_API_KEY="sk-your-key"
|
|
94
|
+
```
|
|
95
|
+
|
|
96
|
+
See the [Environment Variable Reference](docs/env_reference.md) for the full list.
|
|
97
|
+
|
|
98
|
+
### 3. Chat Memory
|
|
99
|
+
|
|
100
|
+
```python
|
|
101
|
+
from hy_memory import HyMemoryClient
|
|
102
|
+
|
|
103
|
+
client = HyMemoryClient(mode="pro")
|
|
104
|
+
|
|
105
|
+
# Write: plain text or OpenAI-format messages
|
|
106
|
+
client.add("I love sci-fi movies, especially Interstellar", user_id="user_1")
|
|
107
|
+
client.add([
|
|
108
|
+
{"role": "user", "content": "Recommend a movie"},
|
|
109
|
+
{"role": "assistant", "content": "Try Interstellar — a sci-fi masterpiece by Nolan"},
|
|
110
|
+
], user_id="user_1")
|
|
111
|
+
|
|
112
|
+
# Search: returns the profile / normal / proactive channels
|
|
113
|
+
results = client.search("What movies does the user like?", user_ids=["user_1"], limit=10)
|
|
114
|
+
for mem in results["memories"]["normal"]:
|
|
115
|
+
print(f" [{mem['score']:.2f}] {mem['content']}")
|
|
116
|
+
|
|
117
|
+
client.close()
|
|
118
|
+
```
|
|
119
|
+
|
|
120
|
+
### 4. Working & Coding Memory
|
|
121
|
+
|
|
122
|
+
Writes must include a tool-call trace (`tool_calls` or `role="tool"` messages) and take effect in `pro` / `ultra` mode only (`lite` ignores `scene` and stores everything as raw memory):
|
|
123
|
+
|
|
124
|
+
```python
|
|
125
|
+
messages = [
|
|
126
|
+
{"role": "user", "content": "Fix the timeout in the search client."},
|
|
127
|
+
{"role": "assistant", "content": "", "tool_calls": [{
|
|
128
|
+
"id": "call_1", "type": "function",
|
|
129
|
+
"function": {"name": "apply_patch", "arguments": '{"path":"src/search.py"}'},
|
|
130
|
+
}]},
|
|
131
|
+
{"role": "tool", "tool_call_id": "call_1", "name": "apply_patch",
|
|
132
|
+
"content": "Patch applied successfully"},
|
|
133
|
+
]
|
|
134
|
+
|
|
135
|
+
client.add(
|
|
136
|
+
messages,
|
|
137
|
+
scene="coding", # or "working"
|
|
138
|
+
user_id="user_123",
|
|
139
|
+
workspace_id="github.com/example/service", # optional: isolate by repository / project
|
|
140
|
+
branch="fix/search-timeout", # optional: requires workspace_id
|
|
141
|
+
)
|
|
142
|
+
|
|
143
|
+
result = client.search(
|
|
144
|
+
"Which timeout implementation was finally kept?",
|
|
145
|
+
scene="coding",
|
|
146
|
+
user_ids=["user_123"],
|
|
147
|
+
workspace_id="github.com/example/service",
|
|
148
|
+
branch="fix/search-timeout",
|
|
149
|
+
limit=5,
|
|
150
|
+
)
|
|
151
|
+
|
|
152
|
+
result["facts"] # fact layer
|
|
153
|
+
result["experiences"] # experience layer
|
|
154
|
+
result["chain_block"] # coding only: version-evolution context
|
|
155
|
+
```
|
|
156
|
+
|
|
157
|
+
### 5. Routing, Source Isolation & Advanced APIs
|
|
158
|
+
|
|
159
|
+
- **Automatic scene routing**: When `scene` is omitted, writes without tool calls go straight to `chat` (zero LLM calls), and writes with tool calls are classified once into `chat` / `working` / `coding`. For searches, `search_mode="default"` goes to `chat` with zero LLM calls, while `search_mode="agentic"` performs scene classification, query rewriting, and time-range parsing. See [Working/Coding Scenes](docs/scene_coding_usage.md).
|
|
160
|
+
- **Separate memories by source**: Pass `source="openclaw" | "cursor" | "codex"` on `add()` and filter with `include_sources` / `exclude_sources` on `search()` to isolate caller applications independently of `agent_id`.
|
|
161
|
+
- **CRUD & System 2 evolution**: `client.get(id)`, `client.update(id, text)`, `client.delete(id)`, `client.list_memories(user_id=...)`, and `client.evolve(user_id=...)` (triggers System 2 in `ultra` mode).
|
|
162
|
+
- **Per-call embedding endpoint override**: Pass `embed_override={"base_url": ..., "api_key": ...}` to `add()` / `search()` or use `with embed_endpoint_override(...):` for concurrency-safe endpoint switching.
|
|
163
|
+
|
|
164
|
+
For provider configuration, storage backends, scenes, and the complete API, see the [Usage Guide](docs/usage.md).
|
|
165
|
+
|
|
166
|
+
---
|
|
167
|
+
|
|
168
|
+
## System Architecture
|
|
169
|
+
|
|
170
|
+
<div align="center">
|
|
171
|
+
<img src="docs/images/architecture.svg" alt="Hy Memory architecture" width="95%">
|
|
172
|
+
</div>
|
|
173
|
+
|
|
174
|
+
Hy Memory provides three memory scenes (`scene`), one per kind of task. `add()` / `search()` go through the scene router first, then into the Chat or the Working / Coding pipeline (orange parts in the diagram are coding-only; without them the pipeline is Working):
|
|
175
|
+
|
|
176
|
+
| `scene` | Tasks | Memory shape |
|
|
177
|
+
|---|---|---|
|
|
178
|
+
| `chat` | Small talk, personal information, preferences, general Q&A | Hierarchical memory (L0–L7) |
|
|
179
|
+
| `working` | Productivity work: documents, spreadsheets, research, financial analysis, content creation, computer operation | Two-layer memory: session facts + reusable experiences |
|
|
180
|
+
| `coding` | Software engineering: coding, debugging, testing, builds, APIs/SDKs, scripts, SQL | The same two-layer memory as `working`, plus a code version-evolution chain (diff chain) |
|
|
181
|
+
|
|
182
|
+
### 1. Chat: Memory Hierarchy
|
|
183
|
+
|
|
184
|
+
For long-term personal memory. Raw conversations are abstracted layer by layer into facts, summaries, a profile, and higher-level cognitive structures:
|
|
185
|
+
|
|
186
|
+
| Layer | Name | Content |
|
|
187
|
+
|---|---|---|
|
|
188
|
+
| L0 | `BASIC_INFO` | Basic information |
|
|
189
|
+
| L1 | `RAW` | Raw conversation (append-only) |
|
|
190
|
+
| L2 | `FACT` | Atomic facts (versioned, immutable records) |
|
|
191
|
+
| L3 | `SUMMARY` | Session summaries |
|
|
192
|
+
| L4 | `IDENTITY` | Reserved |
|
|
193
|
+
| L5 | `KNOWLEDGE` | Reserved |
|
|
194
|
+
| L6 | `SCHEMA` | Mental models (abstract narrative templates, graph layer) |
|
|
195
|
+
| L7 | `INTENTION` | Prospective intentions (with an expiry; demoted to ordinary facts once expired) |
|
|
196
|
+
|
|
197
|
+
**Modes**
|
|
198
|
+
|
|
199
|
+
| Mode | What it does | Graph DB | Use case |
|
|
200
|
+
|------|--------------|----------|----------|
|
|
201
|
+
| `lite` | Raw-only embedding writes and searches, no LLM calls; `scene` and `layers` are ignored | No | Vanilla vector RAG, fast ingestion, zero LLM cost |
|
|
202
|
+
| `pro` | + LLM extraction + reconcile | Optional (`MEMORY_ENABLE_GRAPH`, off by default) | Standard workloads |
|
|
203
|
+
| `ultra` | + System 2 schema induction + cross-domain sweeper (triggered by `evolve()`) | Yes (always on) | Full cognitive architecture |
|
|
204
|
+
|
|
205
|
+
### 2. Working: Two-Layer Productivity Memory
|
|
206
|
+
|
|
207
|
+
For getting things done. One session with tool calls (a trace) produces both layers at once:
|
|
208
|
+
|
|
209
|
+
| Layer | What it records | Per session | Structure |
|
|
210
|
+
|---|---|---|---|
|
|
211
|
+
| **Facts** (`WorkingFact`) | What this session did: the task, the approach, the result | Exactly 1, no threshold | `statement`, `subject`, `files`, `details` (verbatim source) |
|
|
212
|
+
| **Experiences** | Approaches that can be reused next time a similar task comes up | 0–N, must pass a value threshold | `task`, `search_keys`, `solution`, `boundary_envs`, `confidence` |
|
|
213
|
+
|
|
214
|
+
The fact layer guarantees that work which was done is remembered; the experience layer makes what was learned reusable. The two layers link to each other (`fact.derived_experience_ids` ↔ `experience.source_fact_ids`), and superseded facts stay traceable through a task-progress chain (`fact_chain_summary`).
|
|
215
|
+
|
|
216
|
+
### 3. Coding: Two-Layer Memory + Version-Evolution Chain
|
|
217
|
+
|
|
218
|
+
Coding **reuses the same two-layer pipeline and data schema** as Working. It differs in three ways:
|
|
219
|
+
|
|
220
|
+
| | Working | Coding |
|
|
221
|
+
|---|---|---|
|
|
222
|
+
| **Extraction spec** | Productivity-task spec | Software-engineering spec: the subject must be code or a decision; record exact coordinates (file / function / branch) instead of pasting code |
|
|
223
|
+
| **Storage** | `coding_memory.db` + `*_coding_keys` / `*_working_facts` collections | `coding_memory_cv.db` + `*_cv` collections, fully isolated from working |
|
|
224
|
+
| **Version-evolution chain** | None | **Yes**: how many times the same code was changed, and what each change was |
|
|
225
|
+
|
|
226
|
+
**Why a version-evolution chain**: fact extraction deliberately avoids pasting code (the budget goes to more informative coordinates), so a version that was later reverted never appears in a fact.
|
|
227
|
+
That version is usually not in the working tree or at HEAD either, so it cannot be read back afterwards. The chain stores the real diff of every version with zero LLM calls, filling in exactly the information a summary inevitably drops.
|
|
228
|
+
|
|
229
|
+
**Design highlights** (`hy_memory/coding/chain_store.py`):
|
|
230
|
+
|
|
231
|
+
- **A decorator, not a retriever**: the vector layer decides which facts are returned; the chain only attaches, under each fact, every revision of the code it touches (the user's words for that revision + the real diff).
|
|
232
|
+
- **Change sources**: local Git diffs (set `MEMORY_CODING_CHAIN_REPO_ROOT`), or deterministic replace actions with `path` / `old` / `new` in the tool trace.
|
|
233
|
+
- **Chain granularity & isolation**: one thread corresponds to one block of one function in one file on one branch, isolated by `user_id` + `workspace_id`.
|
|
234
|
+
|
|
235
|
+
---
|
|
236
|
+
|
|
237
|
+
## Support
|
|
238
|
+
|
|
239
|
+
### Storage Backends
|
|
240
|
+
|
|
241
|
+
- Vector stores: ChromaDB (default), Qdrant, FAISS
|
|
242
|
+
- Graph stores (ultra mode): Kuzu (default), Neo4j
|
|
243
|
+
- Working / Coding metadata: local SQLite
|
|
244
|
+
|
|
245
|
+
### Documentation
|
|
246
|
+
|
|
247
|
+
- [Usage guide](docs/usage.md) — full configuration reference, API details, deployment modes
|
|
248
|
+
- [Environment variables](docs/env_reference.md) — settings and defaults
|
|
249
|
+
- [Search and Reader guide](docs/hy_memory_search_skill.md) — reader selection, schema quotas, rerank, and return channels
|
|
250
|
+
- [Working/Coding Scenes](docs/scene_coding_usage.md) — productivity-memory routing, response shapes, and coding chain behavior
|
|
251
|
+
- [Graph memory design](docs/pro_graph_design.md) — graph projection, rerank, relation paths, and deployment limits
|
|
252
|
+
- [Environment template](.env.example) — a copy-ready configuration template
|
|
253
|
+
- [MemHub README](memhub/README.md) — local-first desktop & CLI product overview, runtime commands, and privacy boundaries
|
|
254
|
+
- [OpenClaw plugin](plugins/openclaw/README.md) — agent integrations live under `plugins/` (overview: [plugins/README.md](plugins/README.md))
|
|
255
|
+
|
|
256
|
+
### License
|
|
257
|
+
|
|
258
|
+
Hy-Memory is licensed under Apache-2.0. See [LICENSE](LICENSE); third-party
|
|
259
|
+
components remain subject to their respective licenses and notices.
|