russell@unturf.com
a3fd8ddc53
aborist --shards-dir DIR distill iterates over each shard's DB and runs distill_existing on it. Cores live in the same shard as their source surface so the per-shard derivation chain stays self-contained. Per-shard processing also enables trivial parallelism via the distill-shards-parallel Makefile target — one process per shard, no DB contention because each shard is its own file. End-to-end demo on 4-way 10k cur ingest: ingest: 17.6 s wall (4 parallel) distill: 6.2 s sequential per-shard (9185 cores from 10000 surface) verify: 30/30 random Merkle proofs across shards Aggregated counters cover all shards plus per-shard breakdown in the output JSON so the user sees both the union and the parts. Note: cross-shard analyze reports an inflated audit_chain.breaks count because each shard owns its own chain genesis -> ... -> latest, but the UNION view sees them interleaved. Fix coming next. |
||
|---|---|---|
| aborist | ||
| tests | ||
| .gitignore | ||
| CLAUDE.md | ||
| LICENSE | ||
| Makefile | ||
| pyproject.toml | ||
| README.md | ||
aborist
An arborist for trees and forests of cross-linked information.
Aborist ingests documents into a content-addressed, Merkle-committed store. Every
document carries a URI for backtrack and cross-link. Search hooks return hits with
declared audit modes (STRICT / HYBRID / VISUAL) so callers never overclaim
what a result actually proves.
Design
Aborist implements the runtime spec from Merkle-AGI v9.8 / Merkle Providence
Reverse RAG. The 8-dim admissibility key (source_root, question_hash,
model_profile_hash, conversation_hash, governance_policy_hash,
schema_version, canonicalization_version, chunking_version) plus
falsification state ensures cached records are never reused under drift.
Two layered document kinds:
- surface — diverse ingested content (full chunks, FTS-indexed)
- core — distilled records (haiku/equation/snippet) Merkle-signed back to
source surface roots via
derivations
Reversible eviction via chunk tier ∈ {hot, warm, cold}. Cold = leaf hash
- URI only; rehydratable from URI, identity verifiable via leaf hash.
Quick start
make all # bootstrap + fetch + ingest + verify + stats
make search Q='…'
License
AGPL-3.0-only.