A six-deep title chain resolves with one citation per link.
1.21 joules.

Each deed is fetched from the county recorder's e-filing API, normalized to a TransactionRecord JSON-LD document (context: schema.org + dc:terms), and validated against JSON Schema draft 2020-12. Source bytes are kept verbatim alongside the parse; sha256 anchors both.

For each parsed deed, the ingestor emits a prov:Entity (the assertion), a prov:Activity (the parse), and a prov:Agent (the recorder office identified by FIPS code). The wasDerivedFrom edge points at the raw page image; wasAttributedTo names the deputy clerk who recorded it.

Deeds, parties, parcels, and easements become typed nodes; conveys, encumbers, releases become typed edges. The graph is stored as adjacency posting lists in RocksDB; the parcel APN is the natural key. Build cost: 0.18 J for 41 nodes / 57 edges.

GraphRAG resolves the query (parcel:APN-044-238-021, kind:conveyance) by depth-bounded BFS along conveys edges, depth=6. Two cycles get cut by the lis-pendens release node from 2003. Sixteen tuples returned; 0.31 J spent on traversal alone.

For every conveyance edge, the writer attaches { source_uri, sha256, retrieved_at, recorder_office } as a citation envelope (custom IETF I-D in flight, modeled on RFC 8615 well-known + COSE Sign1 RFC 9052). Six envelopes; 1.4 KB each.

Three of the six recorder offices publish a federated ActivityPub Outbox (W3C ActivityPub §5.1). The checker pulls the latest Create/Update activities since the cached as_of; two records had no change, one had a clerical correction — the graph re-resolves the affected edge.

A prov:Bundle wraps the six entities + their activities + agents, signed with an Ed25519 detached JWS (RFC 7515). The bundle is 18.7 KB JSON-LD; the signature is 64 B. Any consumer can re-walk the chain end-to-end without re-querying the recorder.

The answer: "Title vests in the seller free and clear; six prior conveyances, no open encumbrances." Each clause is a span with a citation pointer into the PROV bundle. No retrieval, no inference, no synthesis — only what the graph already proves.