MMETAHUMOTONIC / RESEARCH

MEMORY SUBSTRATE / PUBLIC RESEARCH PROTOTYPE

기억은 모델의 부속품이 아니라,
공유 인프라여야 한다.

HSWM은 출처가 고정된 증거를 불변 world artifact로 컴파일하고, 가중 하이퍼그래프 field와 인증된 readout 경계로 읽는 메모리 substrate입니다. 답을 스스로 만들어내는 reasoner가 아닙니다.

ROLE MEMORY SUBSTRATENOT GENERAL REASONERMODE STATIC FIELD TODAYSTATUS RESEARCH PROTOTYPE

TECHNICAL CONTRACT

증거가 들어와서
안전하게 읽힐 때까지.

각 단계는 다음 단계가 사용할 수 있는 명시적 artifact 또는 typed refusal을 만듭니다.

  1. 01

    Evidence-Preserving World Compiler

    Frozen sources and recorded observations compile into immutable, content-addressed WorldArtifactV1 records or a typed rejection.

  2. 02

    Field Snapshot

    World, embeddings, topology, revision cut, policy, and candidates are byte-addressed as one immutable read boundary.

  3. 03

    Semantic Weight Field

    Evidence-bearing nodes and n-ary relations receive bounded retrieval weights; the measured positive path is currently static additive-j.

  4. 04

    Certified Readout

    Only an exact certified tuple reaches the scoring kernel; scope mismatch returns a payload-free typed refusal.

  5. 05

    Non-destructive Supersession

    Revision can suppress stale evidence while retaining it for audit, but durable replay, compensation, signatures, and concurrent publication remain open.

PUBLIC CLAIM LEDGER

성공·부분 성공·반증·미해결을
한 표에 둡니다.

아래 수치는 공개 저장소에 추적된 영수증과 효능 장부만 사용합니다. 현재 작업트리의 미공개 또는 미추적 결과는 포함하지 않습니다.

1CONFIRMED2PARTIAL2REFUTED2OPEN
CONFIRMEDevidence ↗

Deterministic compiler and fail-closed local read boundary

The checked-in conformance run admitted 40/40 valid controls, refused 400/400 scope-fault calls before scoring, and refused 9/9 injected mutants without returning a payload.

This confirms local conformance for the tested cut. It does not establish retrieval quality, cryptographic authenticity, exhaustive security, or production durability.
PARTIALevidence ↗

Static additive-j retrieval improved a closed 300-row ladder

Across three checked-in MuSiQue/2Wiki runs, HSWM measured +0.0364 support recall@3, +0.0259 nDCG@10, and +0.0729 downstream answer F1 over cosine.

HSWM used 100 offline LLM judgments per run. The ladder omitted strong late-interaction and production graph retrievers, while cosine still led hit@3 and MRR; no state-of-the-art claim follows.
REFUTEDevidence ↗

General cognitive uplift over direct LLM reranking did not replicate

The preregistered cross-dataset criterion failed: pooled HSWM minus direct-LLM answer F1 was -0.1489; the positive 2Wiki delta was not significant at the stored paired-bootstrap threshold.

The supported statement is retrieval improvement over the listed lightweight baselines on this ladder, not a smarter reasoner.
REFUTEDevidence ↗

The tested query-time graph traversal path is deployment-OFF

MuSiQue and 2Wiki certificates selected mu=0, and none of nine tested traversal settings beat the static field on hop-drop.

The implementation falls back to the same snapshot's static field. This is not evidence of successful graph reasoning.
PARTIALevidence ↗

Stale suppression works pointwise; the broader architectural novelty did not

A full-dose non-destructive supersede write removed the maximally confusable stale fact from top-10 in the two checked-in datasets while preserving it for audit.

An external graded revision arm was bit-exact, and a wrong write reduced current recall by 12.69 points on MuSiQue and 31.0 points on 2Wiki. Durable correction and replay are still required.
OPENevidence ↗

Durable multi-writer memory remains an open systems problem

Crash-safe event replay, compensation, concurrent publication, signatures, and external trust distribution are not present-tense capabilities.

The public implementation is a compiler boundary and measurement prototype, not a production memory service.
OPENevidence ↗

Real book-scale advantage is unmeasured

A synthetic experiment establishes mechanism sufficiency when judge-readable aboutness survives vector dilution.

No real NoCha, QASPER, NarrativeQA, or book-scale result has landed, so the website makes no long-document efficacy claim.

EXPLICIT NON-CLAIMS

HSWM이 아직 말할 수 없는 것.

REPRODUCE BEFORE BELIEF

주장보다 먼저
검증기를 실행하세요.

소스 트리 검증은 NumPy와 pytest 개발 extra로 실행됩니다. GPU/LLM production receipt는 별도 계층입니다.

uv sync --extra dev
uv run python verify_efficacy_claims.py --pretty
PYTEST_DISABLE_PLUGIN_AUTOLOAD=1 uv run pytest -q -p no:cacheprovider
uv run python certified_cut_compare.py

OPEN RESEARCH, INCLUDING NEGATIVE RESULTS

좋아 보이는 데모보다,
살아남는 메모리 계약을 함께 만듭시다.