Transparency

Consistency proof that the log grew by append only.

Returns an RFC 6962 / RFC 9162 §2.1.4 consistency proof that the tree of size second contains the tree of size first as a prefix — i.e. the first first entries were not reordered, altered, or removed. second defaults to the log's current size.

This is the only endpoint that can distinguish "the log grew" from "the log was rewritten and re-signed": an inclusion proof verifies against whatever root it is given, so it cannot detect a wholesale reissue. Chain these proofs across successive signed roots from GET /v1/transparency/root and the append-only claim becomes checkable rather than promised.

What it does NOT prove: that Mnemom published every root it computed. A consistent chain of roots shown to you could coexist with a different, internally-consistent chain shown to somebody else (a "split view"). Detecting that requires gossip between independent monitors. MNE-6384.

get/transparency/consistency

Request

  • Base URL: https://api.mnemom.ai/v1
  • URL: https://api.mnemom.ai/v1/transparency/consistency
  • Auth: none required

Query parameters

firstinteger required

The earlier tree_size — typically one you already hold a signed root for.

secondinteger

The later tree_size. Defaults to the log's current size. Must be >= first; a request where it is smaller is rejected rather than answered, because a shrinking log is itself the finding.

Response

Consistency proof between the two tree sizes.

construction'mnemom.transparency.rfc6962/v1' required

Named construction the proof is built against. Versioned wire string — a new construction mints a new identity rather than editing this one, so a verifier can never silently apply the wrong rules.

firstinteger required

The earlier tree_size.

secondinteger required

The later tree_size.

first_rootstring required

Merkle root at tree_size = first. Compare this against the signed root you already hold for that size — if it differs, the log was rewritten.

second_rootstring required

Merkle root at tree_size = second.

hashesstring[] required

RFC 6962 §2.1.2 consistency path, in the order the §2.1.4.2 verification algorithm consumes it. Empty ONLY when first === second (nothing was appended). Note that when first is an exact power of two the generator omits MTH(D[0:first]) because the verifier re-derives it from first_root.

Changes

No recorded changes to this operation across all 1 revision of this API.