paper v0.10: post-review revision — the freeze is over, the queue ships

The review process concluded 2026-08 (operator released the hold). Folds
in exactly the staged erratum-queue + v0.10 items, nothing else:
- corpus count sentence made historical (sixteen at the studied leaves;
  forty-four per fork since — the log records both generations)
- the 3,867/73,573 divergence finding gains its closure everywhere it
  appears: root cause = deployed verifier omitted RFC 9162 S2.1.4.2
  Step 7's terminal sn=0 condition (fixed in ddbb5a4); zero divergences
  post-fix, three-way regression
- new limitations paragraph 'Replay-harness integrity' (a wrong
  observation needs no malice)
- adversary model: defective-harness clause
- claim matrix: 'recorded cone was produced by an audit that performed
  its checks — not established' row
- title page carries 'Revised: August 2026'; submitted v0.9 (7f140356)
  preserved in git history; paper/README signpost updated
This commit is contained in:
mrwulf 2026-08-15 14:17:03 +02:00
parent 840e3fba2c
commit 03c9dabf36
3 changed files with 35 additions and 8 deletions

View file

@ -1,8 +1,13 @@
# Which file is current? # Which file is current?
**`ltl.pdf` / `ltl.tex` — the current paper.** This is the version **`ltl.pdf` / `ltl.tex` — the current paper (v0.10, revised August 2026).**
submitted to the journal on 2026-07-17 and now frozen during review; the The review process concluded in August 2026; this revision folds in the
live copy served at <https://ltl.zkdefi.org/paper> is byte-identical. corrections queued during the freeze (certificate-count update, the
closed consistency-verifier divergence with its `sn = 0` root cause, a
replay-harness-integrity limitation, and an added claim-matrix row). The
version submitted for review (July 17, 2026, sha256 `7f140356…`) is
preserved unchanged in this repository's git history. The live copy at
<https://ltl.zkdefi.org/paper> serves the current revision.
The other files are kept as honest history, not as reading material: The other files are kept as honest history, not as reading material:

Binary file not shown.

View file

@ -47,7 +47,7 @@ showstringspaces=false,breaklines=true,xleftmargin=.5em,xrightmargin=.5em}
\large A Transparency Model and the Lean Transparency Log} \large A Transparency Model and the Lean Transparency Log}
\author{Olaf Horvath\\ \author{Olaf Horvath\\
\small Olaf.Horvath@zkdefi.org \quad ORCID 0009-0004-8008-5805} \small Olaf.Horvath@zkdefi.org \quad ORCID 0009-0004-8008-5805}
\date{July 2026} \date{July 2026 \\ {\normalsize Revised: August 2026}}
\begin{document} \begin{document}
\maketitle \maketitle
@ -174,7 +174,11 @@ verifier and the recursive model proved in Lean are not extensionally equal:
there are malformed size/root combinations accepted only by the deployed there are malformed size/root combinations accepted only by the deployed
verifier. We characterize 3,867 divergences in 73,573 pinned boundary tests verifier. We characterize 3,867 divergences in 73,573 pinned boundary tests
--- every one deployed-accepts-only --- and scope the public attestation --- every one deployed-accepts-only --- and scope the public attestation
accordingly. accordingly. (Post-submission closure, July 2026: the divergence was traced to
the deployed verifier omitting RFC~9162 \S2.1.4.2 Step~7's terminal
$sn=0$ condition; restoring that one conjunct removes every divergence in the
pinned family, confirmed by a three-way regression against an independent
faithful RFC transliteration.)
\end{enumerate} \end{enumerate}
\paragraph{Non-claims.} \paragraph{Non-claims.}
@ -375,7 +379,8 @@ EUF-CMA security of the head-signature scheme, and correct initial acquisition
of the operator public key. of the operator public key.
The model deliberately does not cryptographically exclude fabricated kernel The model deliberately does not cryptographically exclude fabricated kernel
observations. That is a statement about a physical execution on the operator's observations; the same holds when the operator's replay harness is defective
rather than dishonest. That is a statement about a physical execution on the operator's
machine. The mechanism instead makes the claimed execution target precise machine. The mechanism instead makes the claimed execution target precise
enough for a third party to replay. enough for a third party to replay.
@ -621,6 +626,10 @@ reconstruction with the supplied old root and consults the size claims only as
bit-navigation state, so several distinct old-size claims navigate one proof bit-navigation state, so several distinct old-size claims navigate one proof
identically. In 73,573 lied-size boundary cases, 3,867 divergences were identically. In 73,573 lied-size boundary cases, 3,867 divergences were
observed; all were one-sided (deployed accepts, recursive model rejects). observed; all were one-sided (deployed accepts, recursive model rejects).
The root cause was later identified and closed: the deployed loop omitted
RFC~9162 \S2.1.4.2 Step~7's terminal $sn=0$ condition; with the conjunct
restored the pinned family shows zero divergences (three-way regression:
deployed verifier, recursive model, independent RFC transliteration).
The intended consumer flow binds $(n_0,r_0)$ in local persistent state and The intended consumer flow binds $(n_0,r_0)$ in local persistent state and
binds $(n_1,r_1)$ together in a signed head. The present corpus does not prove binds $(n_1,r_1)$ together in a signed head. The present corpus does not prove
@ -1045,7 +1054,9 @@ for a large class of safe Rust programs~\cite{aeneas}. A recent independent
experience report likewise applies a Rust-to-Lean pipeline to cryptographic experience report likewise applies a Rust-to-Lean pipeline to cryptographic
code~\cite{klaus2026}. code~\cite{klaus2026}.
Each fork's corpus contains sixteen reviewed certificates covering: Each fork's corpus contained sixteen reviewed certificates at the
historical leaves studied here (the corpora have since grown to forty-four
per fork --- the log records both generations as separate leaves), covering:
\begin{itemize}[leftmargin=1.6em,itemsep=2pt] \begin{itemize}[leftmargin=1.6em,itemsep=2pt]
\item five-limb field arithmetic over $\Fp$ with value and bound preservation; \item five-limb field arithmetic over $\Fp$ with value and bound preservation;
\item complete twisted-Edwards group operations~\cite{edwards,twisted}; \item complete twisted-Edwards group operations~\cite{edwards,twisted};
@ -1224,7 +1235,9 @@ stable regression boundary.
\begin{remark}[Model/deployment seam] \begin{remark}[Model/deployment seam]
For malformed size claims, the deployed iterative verifier and the recursive For malformed size claims, the deployed iterative verifier and the recursive
model are not extensionally equal. In all 3,867 divergences observed across model are not extensionally equal (figures are the pre-closure measurement;
the $sn=0$ restoration reduces the divergence count in this family to zero).
In all 3,867 divergences observed across
the pinned families the deployed verifier accepted and the model rejected; the the pinned families the deployed verifier accepted and the model rejected; the
reverse direction was not observed, and no global inclusion relation between reverse direction was not observed, and no global inclusion relation between
the two acceptance sets is claimed. the two acceptance sets is claimed.
@ -1307,6 +1320,14 @@ A malicious operator can fabricate a replay report. Signatures and Merkle
proofs make the lie attributable and persistent; they do not make it true. proofs make the lie attributable and persistent; they do not make it true.
Targeted independent replay is the corrective mechanism. Targeted independent replay is the corrective mechanism.
\paragraph{Replay-harness integrity.}
A wrong observation needs no malice: a defective replay harness --- a bug in
the audit driver, a fail-open guard, a truncated transcript --- produces the
same evidentiary damage as a dishonest operator, with the same accountability
answer (the record is attributable and persistent; independent replay corrects
it). The subject corpus's adversarial gate self-tests exist for exactly this
reason and reduce, but cannot eliminate, the exposure.
\paragraph{Theorem identity.} \paragraph{Theorem identity.}
Names and repository commits are not canonical semantic identifiers, and Names and repository commits are not canonical semantic identifiers, and
commit identifiers are SHA-1-based --- a weaker binding than the log's own commit identifiers are SHA-1-based --- a weaker binding than the log's own
@ -1494,6 +1515,7 @@ Equal-size unequal roots in one log context conflict & two valid signatures & co
Observed cone matches local boundary policy & exact set equality & semantic identity of named declarations \\ Observed cone matches local boundary policy & exact set equality & semantic identity of named declarations \\
Operator claims the kernel produced the observation & attestation signature and leaf inclusion & correct provider key; EUF-CMA \\ Operator claims the kernel produced the observation & attestation signature and leaf inclusion & correct provider key; EUF-CMA \\
Kernel actually produced the recorded observation & not cryptographically established; independently checkable by replay & operator and replay-pipeline honesty, or faithful independent replay \\ Kernel actually produced the recorded observation & not cryptographically established; independently checkable by replay & operator and replay-pipeline honesty, or faithful independent replay \\
Recorded cone was produced by an audit that performed its checks & not established --- the audit driver is itself part of the replay pipeline & audit-gate integrity; adversarial gate self-tests reduce this exposure, they do not eliminate it \\
Source corresponds to deployed binary & not established & reproducible build and compiler assurance \\ Source corresponds to deployed binary & not established & reproducible build and compiler assurance \\
Claimed signer implementation produced STH & not established & execution provenance \\ Claimed signer implementation produced STH & not established & execution provenance \\
\bottomrule \bottomrule