Skip to main content
GET
Consistency proof that the log grew by append only.

Query Parameters

first
integer
required

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

Required range: x >= 1
second
integer

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.

Required range: x >= 1

Response

Consistency proof between the two tree sizes.

construction
string
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.

Allowed value: "mnemom.transparency.rfc6962/v1"
first
integer
required

The earlier tree_size.

Required range: x >= 1
second
integer
required

The later tree_size.

Required range: x >= 1
first_root
string
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.

Pattern: ^[0-9a-f]{64}$
second_root
string
required

Merkle root at tree_size = second.

Pattern: ^[0-9a-f]{64}$
hashes
string[]
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.

Pattern: ^[0-9a-f]{64}$