Formalpedia
Prove2Me aims to build the formally verified encyclopedia of mathematics.
418,568 theorems · 359,470 machine checked in Lean 4 · growing daily
The sample data RH1E6S10_D061_2 give 254 zeros of , counted by sign changes of Hardy's , with :
(...)
RS5.BandZeros a b K is the framework's statement that there are increasing ordinates in at which vanishes.
The sample data RH1E6S10_D061_1 give 254 zeros of , counted by sign changes of Hardy's , with :
(...)
RS5.BandZeros a b K is the framework's statement that there are increasing ordinates in at which vanishes.
The sample data RH1E6S10_D061_0 give 254 zeros of , counted by sign changes of Hardy's , with :
(...)
RS5.BandZeros a b K is the framework's statement that there are increasing ordinates in at which vanishes.
Riemann–Siegel sample data for the zeros of with : part 1 of group 061 of segment 10 of the extension from height to .
Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height , a margin 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 between consecutive samples of opposite sign.
Riemann–Siegel sample data for the zeros of with : part 3 of group 061 of segment 10 of the extension from height to .
Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height , a margin 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 between consecutive samples of opposite sign.
The sample data RH1E6S10_D060_0, … of the parts of this group give 1016 zeros of , counted by sign changes of Hardy's , with :
(...)
RS5.BandZeros a b K is the framework's statement that there are increasing ordinates in at which vanishes.
The sample data RH1E6S10_D060_3 give 254 zeros of , counted by sign changes of Hardy's , with :
(...)
RS5.BandZeros a b K is the framework's statement that there are increasing ordinates in at which vanishes.
Riemann–Siegel sample data for the zeros of with : part 2 of group 061 of segment 10 of the extension from height to .
Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height , a margin 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 between consecutive samples of opposite sign.
The sample data RH1E6S10_D060_2 give 254 zeros of , counted by sign changes of Hardy's , with :
(...)
RS5.BandZeros a b K is the framework's statement that there are increasing ordinates in at which vanishes.
Riemann–Siegel sample data for the zeros of with : part 0 of group 061 of segment 10 of the extension from height to .
Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height , a margin 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 between consecutive samples of opposite sign.
Riemann–Siegel sample data for the zeros of with : part 3 of group 060 of segment 10 of the extension from height to .
Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height , a margin 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 between consecutive samples of opposite sign.
The sample data RH1E6S10_D060_1 give 254 zeros of , counted by sign changes of Hardy's , with :
(...)
RS5.BandZeros a b K is the framework's statement that there are increasing ordinates in at which vanishes.
The sample data RH1E6S10_D060_0 give 254 zeros of , counted by sign changes of Hardy's , with :
(...)
RS5.BandZeros a b K is the framework's statement that there are increasing ordinates in at which vanishes.
Riemann–Siegel sample data for the zeros of with : part 2 of group 060 of segment 10 of the extension from height to .
Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height , a margin 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 between consecutive samples of opposite sign.
The sample data RH1E6S10_D059_0, … of the parts of this group give 1016 zeros of , counted by sign changes of Hardy's , with :
(...)
RS5.BandZeros a b K is the framework's statement that there are increasing ordinates in at which vanishes.
Riemann–Siegel sample data for the zeros of with : part 1 of group 060 of segment 10 of the extension from height to .
Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height , a margin 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 between consecutive samples of opposite sign.
Riemann–Siegel sample data for the zeros of with : part 0 of group 060 of segment 10 of the extension from height to .
Each band is a list of records of the structure RS5.Sample from the published framework: a dyadic height , a margin 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 between consecutive samples of opposite sign.
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 and every entry state at the address of crc32_z with the stack pointer 16-byte aligned, whose memory satisfies the precondition separately from , execution terminates. It returns to the caller (the link register) with the stack pointer and the callee-saved registers restored, 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), anycrcandlen: the result is .buf ≠ Z_NULL, with the bytes readable atbufandlen: the result is a 32-bit value (upper half ofx0zero) whose polynomial is . Here is the message of (bit of byte is message bit ), is the polynomial of the low 32 bits ofcrc, is the CRC-32 polynomial and . The buffer is handed back unchanged.
Polynomials of 32-bit values are Kadatch–Jenkins' register convention: bit is the coefficient of .
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.”
The three data objects of the compiled library, read as little-endian 32-bit words, hold the following values. is the CRC-32 polynomial, and the polynomial of a word is read by the register convention: bit is the coefficient of .
crc_tableis 1024 bytes. Its word () is of the one-byte message from , that is . Here is the polynomial of byte : bit of is the coefficient of .crc_braid_tableis 8192 bytes. Its word (, ) is .x2n_tableis 128 bytes. Its word () is (Kadatch–Jenkins eq. (6)).
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 is the polynomial of byte times , mod the CRC-32 polynomial , which is of the one-byte message from the initial value (Kadatch–Jenkins eq. (7)).