Publications · 2

Papers

Preprints, technical reports and specifications, with links to the PDF, the code and a BibTeX entry.

Technical report (draft) · 2026

Bit-Level Columnar Coding of JSON Trees with Append-Only Delta Chains

Tomoya Nagasawa

A JSON encoding that drops byte alignment for variable-width bit fields. One pre-order scan splits a document into twelve column streams coded with width-selecting integer codes, a ±3 delta window and run-length packing; the only count written is the number of leaves. The integer codes are proved prefix-free with closed-form lengths, and the slot and leaf sequences are proved to determine the tree. The same grammar serves as an update format whose length-framed payload chains replay to every version. Sizes computed from the specification on seeded synthetic data: arrays of records take 52–55% of the size of the shortest MessagePack encoding; an interleaved time series is 21% larger.

Technical report (draft) · 2026

Canonical Arithmetization of JSON Documents, with Authenticated Stores and Zero-Knowledge Path Queries

Tomoya Nagasawa

A canonical encoding of JSON values into elements of the BN254 scalar field, proved injective on a precisely stated domain by giving every stage a left inverse: flattening into (path, leaf) rows with empty containers as leaves, shortlex-sorted paths, type-tagged integers, length-prefixed decimal tokens with run compression, and 75-digit blocks behind a guard digit. On this encoding, path queries and non-existence are defined as relations over a commitment and decided exactly by a walk over the token grammar; the paper states what a circuit must constrain for soundness, with an analytic constraint estimate, and specifies a two-level sparse Merkle store with an injective radix map from ids to leaves. All encoding results are machine-checked in Lean 4.