TaoFivePrimes_RHCertificateFastMul
DefinitionTaoFivePrimes_RHCertificateFastMulnumerical-verificationriemann-zetatao-five-primes
A finite recursive natural number multiplication checker using exact binary splits and the three-product Karatsuba identity. Definition only; correctness is a separate theorem and no RH conclusion is asserted.
Definition code
/- Ordinary Karatsuba-style integer checker for scalable certificates. No correctness or RH assertion in this definition. -/
set_option autoImplicit false
set_option maxHeartbeats 0
namespace RHScalableArithmetic
noncomputable def fastMul : Nat → Nat → Nat → Nat → Nat
| 0, _, a, b => a*b
| n+1, k, a, b =>
let a1 := a >>> k
let a0 := a-(a1 <<< k)
let b1 := b >>> k
let b0 := b-(b1 <<< k)
let p0 := fastMul n (k/2) a0 b0
let p1 := fastMul n (k/2) a1 b1
let ps := fastMul n (k/2) (a0+a1) (b0+b1)
p0+((ps-p0-p1) <<< k)+(p1 <<< (2*k))
end RHScalableArithmetic
Source
Transparent mathematical definitions from the local xi/Taylor method of sometik179 (original c9908072-d99a-4431-aad8-a72c6352619a; ordinary-syntax accepted pilot 30db8e24-e604-49d7-ab5c-f7b6f516651a), with theta/Mellin foundations attributed to Gabewhigham. This definition asserts no analytic accuracy or RH conclusion.