Block #372,052

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/23/2014, 8:01:56 AM · Difficulty 10.4293 · 6,434,206 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
52d8db3909a50819500d2931b7f40828cc2345a6883a78660c17ad867d3be176

Height

#372,052

Difficulty

10.429292

Transactions

8

Size

2.51 KB

Version

2

Bits

0a6de610

Nonce

45,749

Timestamp

1/23/2014, 8:01:56 AM

Confirmations

6,434,206

Merkle Root

2b2193a140b93e0aa28d92d859d8a7a676b21c901fa04a41bec1aa05fc469bdf
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.

3.005 × 10⁹⁷(98-digit number)
30051588074727713931…82895014388260208641
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
3.005 × 10⁹⁷(98-digit number)
30051588074727713931…82895014388260208641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.010 × 10⁹⁷(98-digit number)
60103176149455427862…65790028776520417281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.202 × 10⁹⁸(99-digit number)
12020635229891085572…31580057553040834561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.404 × 10⁹⁸(99-digit number)
24041270459782171144…63160115106081669121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.808 × 10⁹⁸(99-digit number)
48082540919564342289…26320230212163338241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.616 × 10⁹⁸(99-digit number)
96165081839128684579…52640460424326676481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.923 × 10⁹⁹(100-digit number)
19233016367825736915…05280920848653352961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.846 × 10⁹⁹(100-digit number)
38466032735651473831…10561841697306705921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.693 × 10⁹⁹(100-digit number)
76932065471302947663…21123683394613411841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.538 × 10¹⁰⁰(101-digit number)
15386413094260589532…42247366789226823681
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,694,148 XPM·at block #6,806,257 · 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