Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Formalpedia

Prove2Me aims to build the formally verified encyclopedia of mathematics.

418,568 theorems · 359,470 machine checked in Lean 4 · growing daily

0
Zeros of ζ on the critical line, segment 10, group 061, part 2 (heights ≈634154.8022–≈634293.3103)Open
by @bwdaugherty
number-theoryriemann-zeta

The sample data RH1E6S10_D061_2 give 254 zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it), counted by sign changes of Hardy's Z(t)Z(t)Z(t), with t∈[≈634154.8022, ≈634293.3103]t\in[≈634154.8022,\,≈634293.3103]t∈[≈634154.8022,≈634293.3103]:

(...)

RS5.BandZeros a b K is the framework's statement that there are KKK increasing ordinates in [a,b][a,b][a,b] at which ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) vanishes.

0
Zeros of ζ on the critical line, segment 10, group 061, part 1 (heights ≈634016.5641–≈634154.8022)Open
by @bwdaugherty
number-theoryriemann-zeta

The sample data RH1E6S10_D061_1 give 254 zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it), counted by sign changes of Hardy's Z(t)Z(t)Z(t), with t∈[≈634016.5641, ≈634154.8022]t\in[≈634016.5641,\,≈634154.8022]t∈[≈634016.5641,≈634154.8022]:

(...)

RS5.BandZeros a b K is the framework's statement that there are KKK increasing ordinates in [a,b][a,b][a,b] at which ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) vanishes.

0
Zeros of ζ on the critical line, segment 10, group 061, part 0 (heights ≈633877.9144–≈634016.5641)Open
by @bwdaugherty
number-theoryriemann-zeta

The sample data RH1E6S10_D061_0 give 254 zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it), counted by sign changes of Hardy's Z(t)Z(t)Z(t), with t∈[≈633877.9144, ≈634016.5641]t\in[≈633877.9144,\,≈634016.5641]t∈[≈633877.9144,≈634016.5641]:

(...)

RS5.BandZeros a b K is the framework's statement that there are KKK increasing ordinates in [a,b][a,b][a,b] at which ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) vanishes.

0
Riemann–Siegel sample data, segment 10, group 061, part 1 (heights ≈634016.5641–≈634154.8022)Definition
by @bwdaugherty
number-theoryriemann-zeta

Riemann–Siegel sample data for the zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) with t∈[≈634016.5641, ≈634154.8022]t\in[≈634016.5641,\,≈634154.8022]t∈[≈634016.5641,≈634154.8022]: part 1 of group 061 of segment 10 of the extension from height 100000100000100000 to 10610^6106.

Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height t=tn/216t=tn/2^{16}t=tn/216, a margin EEE and integer hint fields for the Riemann–Siegel main sum. Consecutive bands share their endpoint sample.

The data were produced by a program and are not trusted; the kernel checks them in the problems named below. The problem RH1E6S10.part_061_1 states that every band of the part passes the kernel-evaluated sharp band checker of the framework, which certifies a sign change of Hardy's Z(t)Z(t)Z(t) between consecutive samples of opposite sign.

0
Riemann–Siegel sample data, segment 10, group 061, part 3 (heights ≈634293.3103–≈634432.0884)Definition
by @bwdaugherty
number-theoryriemann-zeta

Riemann–Siegel sample data for the zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) with t∈[≈634293.3103, ≈634432.0884]t\in[≈634293.3103,\,≈634432.0884]t∈[≈634293.3103,≈634432.0884]: part 3 of group 061 of segment 10 of the extension from height 100000100000100000 to 10610^6106.

Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height t=tn/216t=tn/2^{16}t=tn/216, a margin EEE and integer hint fields for the Riemann–Siegel main sum. Consecutive bands share their endpoint sample.

The data were produced by a program and are not trusted; the kernel checks them in the problems named below. The problem RH1E6S10.part_061_3 states that every band of the part passes the kernel-evaluated sharp band checker of the framework, which certifies a sign change of Hardy's Z(t)Z(t)Z(t) between consecutive samples of opposite sign.

0
Zeros of ζ on the critical line, segment 10, group 060 (heights ≈633323.8348–≈633877.9144)Open
by @bwdaugherty
number-theoryriemann-zeta

The sample data RH1E6S10_D060_0, … of the parts of this group give 1016 zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it), counted by sign changes of Hardy's Z(t)Z(t)Z(t), with t∈[≈633323.8348, ≈633877.9144]t\in[≈633323.8348,\,≈633877.9144]t∈[≈633323.8348,≈633877.9144]:

(...)

RS5.BandZeros a b K is the framework's statement that there are KKK increasing ordinates in [a,b][a,b][a,b] at which ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) vanishes.

0
Zeros of ζ on the critical line, segment 10, group 060, part 3 (heights ≈633739.3985–≈633877.9144)Open
by @bwdaugherty
number-theoryriemann-zeta

The sample data RH1E6S10_D060_3 give 254 zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it), counted by sign changes of Hardy's Z(t)Z(t)Z(t), with t∈[≈633739.3985, ≈633877.9144]t\in[≈633739.3985,\,≈633877.9144]t∈[≈633739.3985,≈633877.9144]:

(...)

RS5.BandZeros a b K is the framework's statement that there are KKK increasing ordinates in [a,b][a,b][a,b] at which ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) vanishes.

0
Riemann–Siegel sample data, segment 10, group 061, part 2 (heights ≈634154.8022–≈634293.3103)Definition
by @bwdaugherty
number-theoryriemann-zeta

Riemann–Siegel sample data for the zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) with t∈[≈634154.8022, ≈634293.3103]t\in[≈634154.8022,\,≈634293.3103]t∈[≈634154.8022,≈634293.3103]: part 2 of group 061 of segment 10 of the extension from height 100000100000100000 to 10610^6106.

Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height t=tn/216t=tn/2^{16}t=tn/216, a margin EEE and integer hint fields for the Riemann–Siegel main sum. Consecutive bands share their endpoint sample.

The data were produced by a program and are not trusted; the kernel checks them in the problems named below. The problem RH1E6S10.part_061_2 states that every band of the part passes the kernel-evaluated sharp band checker of the framework, which certifies a sign change of Hardy's Z(t)Z(t)Z(t) between consecutive samples of opposite sign.

0
Zeros of ζ on the critical line, segment 10, group 060, part 2 (heights ≈633600.8799–≈633739.3985)Open
by @bwdaugherty
number-theoryriemann-zeta

The sample data RH1E6S10_D060_2 give 254 zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it), counted by sign changes of Hardy's Z(t)Z(t)Z(t), with t∈[≈633600.8799, ≈633739.3985]t\in[≈633600.8799,\,≈633739.3985]t∈[≈633600.8799,≈633739.3985]:

(...)

RS5.BandZeros a b K is the framework's statement that there are KKK increasing ordinates in [a,b][a,b][a,b] at which ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) vanishes.

0
Riemann–Siegel sample data, segment 10, group 061, part 0 (heights ≈633877.9144–≈634016.5641)Definition
by @bwdaugherty
number-theoryriemann-zeta

Riemann–Siegel sample data for the zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) with t∈[≈633877.9144, ≈634016.5641]t\in[≈633877.9144,\,≈634016.5641]t∈[≈633877.9144,≈634016.5641]: part 0 of group 061 of segment 10 of the extension from height 100000100000100000 to 10610^6106.

Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height t=tn/216t=tn/2^{16}t=tn/216, a margin EEE and integer hint fields for the Riemann–Siegel main sum. Consecutive bands share their endpoint sample.

The data were produced by a program and are not trusted; the kernel checks them in the problems named below. The problem RH1E6S10.part_061_0 states that every band of the part passes the kernel-evaluated sharp band checker of the framework, which certifies a sign change of Hardy's Z(t)Z(t)Z(t) between consecutive samples of opposite sign.

0
Riemann–Siegel sample data, segment 10, group 060, part 3 (heights ≈633739.3985–≈633877.9144)Definition
by @bwdaugherty
number-theoryriemann-zeta

Riemann–Siegel sample data for the zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) with t∈[≈633739.3985, ≈633877.9144]t\in[≈633739.3985,\,≈633877.9144]t∈[≈633739.3985,≈633877.9144]: part 3 of group 060 of segment 10 of the extension from height 100000100000100000 to 10610^6106.

Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height t=tn/216t=tn/2^{16}t=tn/216, a margin EEE and integer hint fields for the Riemann–Siegel main sum. Consecutive bands share their endpoint sample.

The data were produced by a program and are not trusted; the kernel checks them in the problems named below. The problem RH1E6S10.part_060_3 states that every band of the part passes the kernel-evaluated sharp band checker of the framework, which certifies a sign change of Hardy's Z(t)Z(t)Z(t) between consecutive samples of opposite sign.

0
Zeros of ζ on the critical line, segment 10, group 060, part 1 (heights ≈633462.4950–≈633600.8799)Open
by @bwdaugherty
number-theoryriemann-zeta

The sample data RH1E6S10_D060_1 give 254 zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it), counted by sign changes of Hardy's Z(t)Z(t)Z(t), with t∈[≈633462.4950, ≈633600.8799]t\in[≈633462.4950,\,≈633600.8799]t∈[≈633462.4950,≈633600.8799]:

(...)

RS5.BandZeros a b K is the framework's statement that there are KKK increasing ordinates in [a,b][a,b][a,b] at which ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) vanishes.

0
Zeros of ζ on the critical line, segment 10, group 060, part 0 (heights ≈633323.8348–≈633462.4950)Open
by @bwdaugherty
number-theoryriemann-zeta

The sample data RH1E6S10_D060_0 give 254 zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it), counted by sign changes of Hardy's Z(t)Z(t)Z(t), with t∈[≈633323.8348, ≈633462.4950]t\in[≈633323.8348,\,≈633462.4950]t∈[≈633323.8348,≈633462.4950]:

(...)

RS5.BandZeros a b K is the framework's statement that there are KKK increasing ordinates in [a,b][a,b][a,b] at which ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) vanishes.

0
Riemann–Siegel sample data, segment 10, group 060, part 2 (heights ≈633600.8799–≈633739.3985)Definition
by @bwdaugherty
number-theoryriemann-zeta

Riemann–Siegel sample data for the zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) with t∈[≈633600.8799, ≈633739.3985]t\in[≈633600.8799,\,≈633739.3985]t∈[≈633600.8799,≈633739.3985]: part 2 of group 060 of segment 10 of the extension from height 100000100000100000 to 10610^6106.

Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height t=tn/216t=tn/2^{16}t=tn/216, a margin EEE and integer hint fields for the Riemann–Siegel main sum. Consecutive bands share their endpoint sample.

The data were produced by a program and are not trusted; the kernel checks them in the problems named below. The problem RH1E6S10.part_060_2 states that every band of the part passes the kernel-evaluated sharp band checker of the framework, which certifies a sign change of Hardy's Z(t)Z(t)Z(t) between consecutive samples of opposite sign.

0
Zeros of ζ on the critical line, segment 10, group 059 (heights ≈632769.5768–≈633323.8348)Open
by @bwdaugherty
number-theoryriemann-zeta

The sample data RH1E6S10_D059_0, … of the parts of this group give 1016 zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it), counted by sign changes of Hardy's Z(t)Z(t)Z(t), with t∈[≈632769.5768, ≈633323.8348]t\in[≈632769.5768,\,≈633323.8348]t∈[≈632769.5768,≈633323.8348]:

(...)

RS5.BandZeros a b K is the framework's statement that there are KKK increasing ordinates in [a,b][a,b][a,b] at which ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) vanishes.

0
Riemann–Siegel sample data, segment 10, group 060, part 1 (heights ≈633462.4950–≈633600.8799)Definition
by @bwdaugherty
number-theoryriemann-zeta

Riemann–Siegel sample data for the zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) with t∈[≈633462.4950, ≈633600.8799]t\in[≈633462.4950,\,≈633600.8799]t∈[≈633462.4950,≈633600.8799]: part 1 of group 060 of segment 10 of the extension from height 100000100000100000 to 10610^6106.

Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height t=tn/216t=tn/2^{16}t=tn/216, a margin EEE and integer hint fields for the Riemann–Siegel main sum. Consecutive bands share their endpoint sample.

The data were produced by a program and are not trusted; the kernel checks them in the problems named below. The problem RH1E6S10.part_060_1 states that every band of the part passes the kernel-evaluated sharp band checker of the framework, which certifies a sign change of Hardy's Z(t)Z(t)Z(t) between consecutive samples of opposite sign.

0
Riemann–Siegel sample data, segment 10, group 060, part 0 (heights ≈633323.8348–≈633462.4950)Definition
by @bwdaugherty
number-theoryriemann-zeta

Riemann–Siegel sample data for the zeros of ζ(1/2+it)\zeta(1/2+it)ζ(1/2+it) with t∈[≈633323.8348, ≈633462.4950]t\in[≈633323.8348,\,≈633462.4950]t∈[≈633323.8348,≈633462.4950]: part 0 of group 060 of segment 10 of the extension from height 100000100000100000 to 10610^6106.

Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height t=tn/216t=tn/2^{16}t=tn/216, a margin EEE and integer hint fields for the Riemann–Siegel main sum. Consecutive bands share their endpoint sample.

The data were produced by a program and are not trusted; the kernel checks them in the problems named below. The problem RH1E6S10.part_060_0 states that every band of the part passes the kernel-evaluated sharp band checker of the framework, which certifies a sign change of Hardy's Z(t)Z(t)Z(t) between consecutive samples of opposite sign.

0
zlib.h, crc32_z() — the compiled crc32_z computes CRC-32Open
by dbenbenn
aarch64crcmachine-code-verificationseparation-logiczlib

Total correctness of crc32_z in the AArch64 object code of zlib 1.3.1's crc32.c (zlibCrc32Lib). For every placement of the library that the linker could produce (Placeable), every frame RRR and every entry state at the address of crc32_z with the stack pointer 16-byte aligned, whose memory satisfies the precondition separately from RRR, execution terminates. It returns to the caller (the link register) with the stack pointer and the callee-saved registers restored, RRR untouched, and the postcondition holding. It never panics, exits or runs out of memory.

The arguments follow AAPCS64: crc in x0, buf in x1, len in x2, the result in x0. In every case the caller lends the 96 bytes below the stack pointer (any contents) and the library's three tables in their initial state, and gets both back.

  • buf = Z_NULL (x1 = 0), any crc and len: the result is 000.
  • buf ≠ Z_NULL, with the bytes b0,…,bn−1b_0, \dots, b_{n-1}b0​,…,bn−1​ readable at buf and len =n= n=n: the result is a 32-bit value (upper half of x0 zero) whose polynomial is CRCu(M,v)\mathrm{CRC}_u(M, v)CRCu​(M,v). Here MMM is the message of b0…bn−1b_0 \dots b_{n-1}b0​…bn−1​ (bit iii of byte jjj is message bit 8j+i8j + i8j+i), vvv is the polynomial of the low 32 bits of crc, PPP is the CRC-32 polynomial and u=x31+⋯+x+1u = x^{31} + \dots + x + 1u=x31+⋯+x+1. The buffer is handed back unchanged.

Polynomials of 32-bit values are Kadatch–Jenkins' register convention: bit iii is the coefficient of x31−ix^{31-i}x31−i.

zlib.h, lines 1732–1736 and 1751: “Update a running CRC-32 with the bytes buf[0..len-1] and return the updated CRC-32. A CRC-32 value is in the range of a 32-bit unsigned integer. If buf is Z_NULL, this function returns the required initial value for the crc. Pre- and post-conditioning (one's complement) is performed within this function so it shouldn't be done by the application.” (of crc32), and of crc32_z: “Same as crc32(), but with a size_t length.”

0
crc32.c, the CRC tables — crc_table, crc_braid_table and x2n_table hold their CRC valuesOpen
by dbenbenn
aarch64crcmachine-code-verificationseparation-logiczlib

The three data objects of the compiled library, read as little-endian 32-bit words, hold the following values. PPP is the CRC-32 polynomial, and the polynomial of a word is read by the register convention: bit iii is the coefficient of x31−ix^{31-i}x31−i.

  • crc_table is 1024 bytes. Its word iii (i<256i < 256i<256) is CRC0\mathrm{CRC}_0CRC0​ of the one-byte message iii from 000, that is Bi(x) x32 mod PB_i(x)\,x^{32} \bmod PBi​(x)x32modP. Here Bi(x)B_i(x)Bi​(x) is the polynomial of byte iii: bit jjj of iii is the coefficient of x7−jx^{7-j}x7−j.
  • crc_braid_table is 8192 bytes. Its word 256k+i256k + i256k+i (k<8k < 8k<8, i<256i < 256i<256) is Bi(x) x8(5⋅8+3−k) mod PB_i(x)\,x^{8(5 \cdot 8 + 3 - k)} \bmod PBi​(x)x8(5⋅8+3−k)modP.
  • x2n_table is 128 bytes. Its word kkk (k<32k < 32k<32) is Pow2k(k)=x2k mod P\mathrm{Pow2k}(k) = x^{2^k} \bmod PPow2k(k)=x2kmodP (Kadatch–Jenkins eq. (6)).
0
zlib.h, get_crc_table() — get_crc_table returns the byte-wise CRC tableOpen
by dbenbenn
aarch64crcmachine-code-verificationseparation-logiczlib

Total correctness of get_crc_table in the AArch64 object code of zlib 1.3.1's crc32.c. "Total correctness" is read as in the goal: for every placement of the library, frame and AAPCS64 entry state, the function terminates and returns with the calling convention preserved.

The caller lends the library's tables and gets them back. The result x0 is the address of the library's crc_table under the placement, and points to 1024 readable bytes holding 256 little-endian 32-bit words. Word iii is the polynomial of byte iii times x32x^{32}x32, mod the CRC-32 polynomial PPP, which is CRC0\mathrm{CRC}_0CRC0​ of the one-byte message iii from the initial value 000 (Kadatch–Jenkins eq. (7)).

Page 1 of 27329

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me