A · THE VIRTUAL FILE 5 · RTP

A standard file that doesn't physically exist: a new table of contents makes many stored files answer as one — no copying, no rewriting. Plus: indexes added on the fly, broken files repaired without touching the original, files combined only after their rows provably line up.

B · THE EXACT BILL 2 · RTP

An exact account of every read: which bytes, from which real files, complete to the last byte — with an independently checkable receipt.

C · ACCESS CONTROL 7 · RTP

Denied data isn't hidden or masked — it has no address to ask for. One rule denies a whole classification; a rehearsal mode previews a policy before it goes live; the store itself blocks the proxy's own back door.

D · VERSION PROMISES 1 · DESIGNED

A published dataset description is a promise: readers only see versions whose every byte still exists; versions appear atomically and retire cleanly.

E · PORTABLE TRUST 3 · IDEA

Trust that travels with the data: a signed note in each file saying what it was assembled from; reads carrying a declared purpose; edits made only to the description.

F · PLATFORM INTEGRITY 2 · RTP

A shared cache built so one user's data cannot leak into another's answers — impossible by design, not merely unlikely; and a signed audit log where any tampering or deletion is detectable with standard tools.

G · DERIVED DATA DESIGNED

The same guarantees for data made from other data: results carry permits naming their sources; deleting a source provably reaches everything built on it; a query touching anything off-limits is refused before it runs.

H · EARLY IDEAS 4 · IDEA

Engines declaring what a query is for (proof, not inference); reading relocated datasets in place (time-sensitive — the standard is moving); per-request timing; safe summaries for AI assistants.