A local-first, hyper-relational knowledge base with content-addressable storage (CAS). Built as a Master's thesis prototype. What it is Hyper-relational graph : Knowledge is stored as statement(Subject, Predicate, Object, Properties) . Subjects and objects can themselves be statements (reification), enabling claims about claims. Content-addressable storage : Files are staged, SHA-256 hashed, and committed atomically alongside their graph metadata. Deduplication is automatic. Time-travel : Updates create new statement versions linked via replaces_id . pl history walks the version chain. Prolog-first : Trealla Prolog is the main runtime. SQLite and Raylib are accessed via C shared libraries loaded through FFI. Interactive GUI : A Raylib-based graph viewer with image previews, a query bar, and node search. Build Dependencies : Clang, X11 (Linux) or Xcode CLT (macOS). Trealla Prolog, Raylib, raygui, and SQLite are included as submodules.…