The volume posts seven problems, stated as mathematics. They are reproduced here from the source of record, word for word, each with its own address.
Prove or refute the coverage theorem: that the standard analytic roster represents every exit-locus formation of the completed descent, i.e. \(C_{\mathrm{cov}}\) holds for \(\zeta\).
Determine whether the di-cone sextic's paired critical ratios admit a spectral interpretation under the prime-fused field, and prove or refute the silhouette comparison at all truncations.
Prove the unconditional stiffness wedge: exhibit exact boundary bounds under which \(\Phi>0\) on a right neighborhood of the line, or show no such bounds exist.
Extend the kernel formalization from \(\mathsf G_{\mathrm K}\) to the full strict grammar — eliminating the implementation blank variant, which the discipline of record excludes at every layer — and machine-check numeral canonicality.
Characterize the class for which the Selberg-axiom recovery of the trace typing is exact, and decide class-wide Admission for a nontrivial finitely axiomatized subclass.
Give a formation-faithful interpretation of a zero-based foundation into \(\Pdag\) and compute its price on the explicit-formula ledger.
Construct an admitting model of the referenced theory \(\Pbase+\mathrm{RefClauses}\) — a model of the reference clauses whose referent admits — or prove that the referenced theory leaves underived \(\CounterAdmZeta\) by other means. Either, together with membership of the referent in the class and internalization of a finite contrary witness, yields \(\RHClass\); with the converse adequacy of the analytic interpretation, the three statements \(\RHClass\), non-derivability of \(\CounterAdmZeta\) over the referenced theory, and existence of an admitting model are equivalent. Model B separates the class-wide schema precisely by evading the reference clauses, so the proved class-wide theorem stands apart: it leaves unsupplied nor is supplied by this instance; the two are related by an existential introduction in the easy direction only.
Standing
Each problem is stated in the register in which it is posed, with the sponsor of every term named in the volume. A partial result is a result: exact boundary constants toward Problem 3, a machine-checked constructor case toward Problem 4, a finite axiom set with its witnessing models toward Problem 5, a near-miss configuration toward Problem 7 — each is a mathematical object with a statement attached, and each is read under the review terms of this record. Refutations are read on the same terms and recorded as positive contributions.
Problem 7 carries the chain that joins the class-wide theorem to the zeta instance, and it is the one to read first: it states exactly where the proved independence result and the reference clauses meet. Each of the seven also stands behind a lock in the Seven, with a published checker and a prize from the treasury.
Write to parkeremmerson@icloud.com with the problem number, the statement of what is established, its register, and the evidence.