Every study, searchable

Implementations of this protocol must agree byte for byte on claim IDs, bundle hashes, Merkle log proofs, signatures, and the IDs operators and volunteers go by. This fifth version adds vectors for IDs no log assigns: an operator's ID is op: and the SHA-256 of its first public key, a volunteer's is obs: and that of their first passkey, and an entry's digest as signed lets two logs compare entries. The log's example leaves now name their operator by ID. An independent checker recomputes every vector with 0 claim-ID, 0 bundle, 0 log, 0 signature, and 0 ID mismatches, and accepts none of the invalid cases. Hashing Python's json.dumps output still gets 3 of 20 claim IDs wrong.

• Published, Reproduced, Reviewed.Published, Reproduced, Reviewed: The claim-ID test vectors in data/claim-id-vectors.json are correct: an implementation written independently of the reference node recomputes every listed claim ID from the claims.json text, verification inputs, and declared results given with it, rejects every claims file listed as invalid, and computes no ID for any case listed as unresolved, where a claim names a result the bundle doesn't declare.
• Published, Reproduced, Reviewed.Published, Reproduced, Reviewed: The bundle test vectors in data/bundle-vectors.json are correct: an independent implementation recomputes every listed file digest, bundle hash, and verification-inputs digest over the files under code/, env/, data/, and proofs/, and rejects every path set listed as invalid.
• Published, Reproduced, Reviewed.Published, Reproduced, Reviewed: The log test vectors in data/log-vectors.json are correct: an independent implementation of RFC 9162 recomputes the empty-tree root and every listed root hash, inclusion proof, consistency proof, and example leaf hash; every listed proof verifies, and every proof listed as invalid fails; and each example leaf holds its entry with every signature replaced by the SHA-256 of the signature's canonical JSON, over a signed entry that verifies against its operator's key; and each key entry's leaf names its operator by the ID that key makes.

3 more claims

This work tests a preregistered question on open New York City data: whether a fixed lag of CDC National Wastewater Surveillance System (NWSS) SARS-CoV-2 percentile predicts rises in confirmed COVID-19 cases better than the same-day percentile. The locked primary contrast is the difference in area under the receiver operating characteristic curve (AUROC) between a seven-day lag and a zero-day lag. On the pinned public snapshots, the lag-seven AUROC is 0.449326 and the lag-zero AUROC is 0.522145, so the delta is -0.07282 and the preregistered success flag false is false. The negative result is deterministic and re-run from code/analyze.py.

• Published, Reproduced, Reviewed.Published, Reproduced, Reviewed: Under the preregistered NYC analysis, the AUROC of a fixed 7-day lag of population-weighted CDC NWSS SARS-CoV-2 wastewater percentile for predicting a subsequent rise in NYC confirmed COVID-19 cases is 0.449326, which does not exceed the contemporaneous lag-0 AUROC of 0.522145 (delta -0.07282), so the locked success rule AUROC_lag7 > AUROC_lag0 fails.

Can repeated rounding hide escape even when a Mandelbrot parameter is exactly representable? We construct the first binary floating-point successor of the real cusp and give an elementary invariant argument: both separate rounding and single-round evaluation keep its computed critical orbit below an absorbing boundary, although its exact orbit is unbounded. An exact rational simulator and directed integer enclosures check 22 precisions. At single precision, the stationary transitions occur at 8999 and 9532, while the exact orbit first escapes at 18196. This supplies an adversarial numerical test family; it does not claim discovery of rounding artifacts or slow escape.

• Published, Reviewed.Published, Reviewed: For every binary significand precision p >= 3, the exactly representable parameter c_p = 1/4 + 2^(-(p+1)) has an unbounded exact critical orbit, while both nearest-even recurrences RN_p(RN_p(x_n^2)+c_p) and RN_p(x_n^2+c_p), starting at zero, stay in [0,1/2] for every iterate, with 1/2 absorbing.
• Published, Reproduced, Reviewed.Published, Reproduced, Reviewed: For all 22 precisions p from 3 through 24, the supplied exact-dyadic benchmark reaches the stationary value 1/2 under both rounding models and certifies finite exact first escapes, with first stationary transitions 8999 and 9532 and exact first escape 18196 at p=24.

We provide an explicit rational parameter for every finite iteration cutoff. Its critical orbit remains uniformly below the usual escape radius throughout the cutoff, although an elementary growth argument proves that it eventually escapes. The contribution is a deterministic adversarial test family, a short uniform proof, and a certified finite benchmark. Integer enclosures and Arb ball arithmetic agree on 7 cases, with first-escape counts [23,61,212,815,3228,12879,51482]. Slow escape near the real parabolic cusp is established in the literature; we claim no discovery of that phenomenon or of its asymptotic law.

• Published, Reviewed.Published, Reviewed: For every integer T >= 1, the real parameter c_T = 1/4 + 1/[16(T+1)^2] has critical iterates z_0 = 0 and z_(n+1) = z_n^2 + c_T in [0,17/32] for 0 <= n <= T, but an unbounded critical orbit.
• Published, Reproduced, Reviewed.Published, Reproduced, Reviewed: The exact-rational benchmark parameters generated from cutoffs [1, 4, 16, 64, 256, 1024, 4096] have first critical-orbit escape iterations [23, 61, 212, 815, 3228, 12879, 51482], with all 7 counts certified and matched by integer dyadic enclosures and Arb ball arithmetic, and all 49 exact-rational control checks passing.

How does repeated monitoring change false-positive rates for a coin-toss test? This resource computes exact rejection probabilities and expected observation counts using integer path weights. At the selected horizon, a fixed binomial test rejects a fair-coin null with probability 0.04431304005703379, repeated binomial testing with probability 0.20205809786793333, and a likelihood-ratio test with probability 0.04088964341296718. The benchmark provides 36 scenario rows and passes 18 exhaustive-enumeration comparisons. It supplies an auditable numerical illustration of established optional-stopping behavior, without asserting a new statistical theorem.

• Published, Reproduced, Reviewed.Published, Reproduced, Reviewed: A dependency-free exact-path benchmark computes rejection probabilities and expected sample counts for fixed, repeatedly monitored, and likelihood-ratio tests across the declared Bernoulli scenarios, and agrees with exhaustive enumeration in every declared oracle case.