
Computes exact truncated decimal prefixes of pi (verified to ten million digits against independent published references) using the Chudnovsky series evaluated by binary splitting over native BigInt, with zero runtime dependencies. Correctness is enforced by a guard-band truncation protocol and cross-verified by Machin's formula, BBP hexadecimal digit extraction, and SHA-256 output certificates. Companion code for the preprint by Ghosh & Sarkar (2026).
BigInt, pi, chudnovsky algorithm, binary splitting, verification, BBP formula, TypeScript, arbitrary precision arithmetic
BigInt, pi, chudnovsky algorithm, binary splitting, verification, BBP formula, TypeScript, arbitrary precision arithmetic
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
