Block #472,130

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

1.555 × 10¹⁰⁰(101-digit number)

15550586915194939779…48591849489898164481

Discovered Prime Numbers

p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

origin + 1

1.555 × 10¹⁰⁰(101-digit number)

15550586915194939779…48591849489898164481

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^1 × origin + 1

3.110 × 10¹⁰⁰(101-digit number)

31101173830389879558…97183698979796328961

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^2 × origin + 1

6.220 × 10¹⁰⁰(101-digit number)

62202347660779759116…94367397959592657921

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^3 × origin + 1

1.244 × 10¹⁰¹(102-digit number)

12440469532155951823…88734795919185315841

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^4 × origin + 1

2.488 × 10¹⁰¹(102-digit number)

24880939064311903646…77469591838370631681

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^5 × origin + 1

4.976 × 10¹⁰¹(102-digit number)

49761878128623807293…54939183676741263361

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^6 × origin + 1

9.952 × 10¹⁰¹(102-digit number)

99523756257247614586…09878367353482526721

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^7 × origin + 1

1.990 × 10¹⁰²(103-digit number)

19904751251449522917…19756734706965053441

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^8 × origin + 1

3.980 × 10¹⁰²(103-digit number)

39809502502899045834…39513469413930106881

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^9 × origin + 1

7.961 × 10¹⁰²(103-digit number)

79619005005798091669…79026938827860213761

Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆

Rarity

UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)

Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …

Cross-reference on Chainz Explorer