Block #432,470

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/6/2014, 10:25:01 PM · Difficulty 10.3415 · 6,378,045 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
d70473f42b27c333bfc36e53d5b776199f8b61b86e60872a82be8f90f68eb1e8

Height

#432,470

Difficulty

10.341468

Transactions

1

Size

1005 B

Version

2

Bits

0a576a71

Nonce

5,062

Timestamp

3/6/2014, 10:25:01 PM

Confirmations

6,378,045

Merkle Root

86eb1b57608e19b358f813384401185508c2bca02ba16c950e33c7f38c9feabb
Prime Chain Origin

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.

2.990 × 10⁹⁸(99-digit number)
29903650695711996151…56451458540583383021
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.

1
origin + 1
2.990 × 10⁹⁸(99-digit number)
29903650695711996151…56451458540583383021
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.980 × 10⁹⁸(99-digit number)
59807301391423992303…12902917081166766041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.196 × 10⁹⁹(100-digit number)
11961460278284798460…25805834162333532081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.392 × 10⁹⁹(100-digit number)
23922920556569596921…51611668324667064161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.784 × 10⁹⁹(100-digit number)
47845841113139193843…03223336649334128321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.569 × 10⁹⁹(100-digit number)
95691682226278387686…06446673298668256641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.913 × 10¹⁰⁰(101-digit number)
19138336445255677537…12893346597336513281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.827 × 10¹⁰⁰(101-digit number)
38276672890511355074…25786693194673026561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.655 × 10¹⁰⁰(101-digit number)
76553345781022710148…51573386389346053121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.531 × 10¹⁰¹(102-digit number)
15310669156204542029…03146772778692106241
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, …
Circulating Supply:57,728,205 XPM·at block #6,810,514 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy