MALTArc-granularity data authentication

Authenticate graph-shaped relations with vector commitments, keep payloads in CAS, and verify locally without making a Merkle-DAG block the proof carrier.

Research narrative

Technical docs

v0.0.6 release

Research narrative

Problem framing, abstraction, system design, and evaluation story aligned with the current paper memory.

Technical docs

The released v0.0.6 SDK-only core plus independent gateway and trusted clients, with frozen v0.0.4 artifact compatibility.

Root-centric verification

Readers verify result plus ProofList against an explicit trusted root. The server runtime does not publish heads or decide freshness.

Design focus

Authenticate structure as graph-shaped relations, keep verification local.

MALT starts from structured data whose relationships can be normalized as graph-shaped nodes and relations. It authenticates individual arcs through list and map semantics, vector-commitment proofs, and a portable verifier.

Immutable payloads can still live naturally in CAS. MALT keeps their storage separate from arc authentication and from execution/access. ArcTable, caches, executors, and gateways are untrusted materialization and delivery components; reads return results plus ProofLists that clients verify locally.

A public MALT service can accelerate root-relative reads. It is not the authority for the latest root. Applications publish roots; readers verify every returned result against those roots.

Root-centric read and ProofList verification flow

Research narrativeFollow the problem, abstraction, system design, and evaluation story for MALT as a systems research project.

Current pre-v1 contractsUse canonical segments with malt.resolve/v0alpha1 and malt.read/v0alpha1 through the gateway; the API remains pre-v1.

Server runtime modelUnderstand the root-centric resolver/writer contract: apply explicit-root mutations and return result + ProofList.