BBP Hex Algorithm
π = Σ (1 / 16^k) × (
4 / (8k + 1)
- 2 / (8k + 4)
- 1 / (8k + 5)
- 1 / (8k + 6)
)BBP hexadecimal implementation version 1Last updated
Was this helpful?
Picoin currently uses the BBP hexadecimal algorithm.
The Bailey–Borwein–Plouffe (BBP) formula allows direct computation of distant hexadecimal digits of π without calculating all previous digits.
This property makes BBP particularly suitable for distributed verification.
The BBP formula is defined as:
π = Σ (1 / 16^k) × (
4 / (8k + 1)
- 2 / (8k + 4)
- 1 / (8k + 5)
- 1 / (8k + 6)
)Advantages:
random access computation;
efficient verification;
deterministic outputs;
scalable distributed tasks.
Picoin currently uses:
bbp_hex_v1
BBP hexadecimal implementation version 1as the primary mining algorithm.
Future versions may support additional algorithms.
Last updated
Was this helpful?
Was this helpful?
