Pith. sign in
def

sampleLocalHeaderOffset

definition
show as:
module
IndisputableMonolith.Verification.GWTC3RingdownHDF5SampleSchema
domain
Verification
line
54 · github
papers citing
none yet

plain-language theorem explainer

Records the ZIP local-header byte offset 66,237,197 for the smallest GWTC-3 ringdown HDF5 member (rin_S190727h). Anyone auditing the one-member schema inspection or reproducing the HTTP range-read pipeline cites this constant. It is a literal Nat binding fixed by the live central-directory measurement.

Claim. The local-header offset of the sampled GWTC-3 ringdown HDF5 ZIP member is the natural number $66237197$.

background

The module freezes a structural snapshot of one real HDF5 posterior file inside the public GWTC-3 ringdown ZIP, obtained without fetching the full 1.44 GB archive. The method reads the ZIP central directory by HTTP range request, selects the smallest .h5 member (rin/rin_S190727h_pyring_DS_1mode_10M.h5), range-reads only that member's local header and compressed payload, inflates locally, and inspects the schema with h5py.

Among the live metadata, the local-header offset is reported as 66,237,197 bytes from the start of the archive. Sibling constants pin compressed size, uncompressed size, data offset, object/group/dataset counts, and the path and shape of /EXP6/posterior_samples. The module status is structural theorem: zero sorry, zero new RS-internal axioms; it is schema inspection only, not a posterior-likelihood claim.

proof idea

Pure definition: the identifier is bound to the literal natural number 66237197. No tactic proof, no lemmas, no computation inside Lean; the value is the measured local-header offset from the companion reproducibility script and the module doc-comment.

why it matters

Pins a concrete archive coordinate so downstream verification can name the exact byte window that was range-read for the sample member. Together with the sibling size and offset constants it makes the one-member HDF5 schema inspection reproducible and auditable inside the Recognition Science verification layer. It does not advance the T0–T8 forcing chain, RCL, or mass-ladder physics; it supports empirical closure of the GWTC-3 ringdown data path used by the broader verification stack. No parent theorems are listed as direct dependents in the graph.

Switch to Lean above to see the machine-checked source, dependencies, and usage graph.