Block #552,741

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/19/2014, 4:40:33 PM · Difficulty 10.9628 · 6,261,163 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ba03d9e7034473eea89f4e1d331c8493892f7681f9776e638ed9d0d3bd3e1779

Height

#552,741

Difficulty

10.962758

Transactions

9

Size

1.97 KB

Version

2

Bits

0af67748

Nonce

92,698,631

Timestamp

5/19/2014, 4:40:33 PM

Confirmations

6,261,163

Merkle Root

2fb9b32b792e560a481f318fe45484109c77706aaa40d13cfab29d818e269fa3
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.090 × 10⁹⁹(100-digit number)
20904172620189580088…20400868152896794881
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.090 × 10⁹⁹(100-digit number)
20904172620189580088…20400868152896794881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.180 × 10⁹⁹(100-digit number)
41808345240379160177…40801736305793589761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.361 × 10⁹⁹(100-digit number)
83616690480758320355…81603472611587179521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.672 × 10¹⁰⁰(101-digit number)
16723338096151664071…63206945223174359041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.344 × 10¹⁰⁰(101-digit number)
33446676192303328142…26413890446348718081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.689 × 10¹⁰⁰(101-digit number)
66893352384606656284…52827780892697436161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.337 × 10¹⁰¹(102-digit number)
13378670476921331256…05655561785394872321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.675 × 10¹⁰¹(102-digit number)
26757340953842662513…11311123570789744641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.351 × 10¹⁰¹(102-digit number)
53514681907685325027…22622247141579489281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.070 × 10¹⁰²(103-digit number)
10702936381537065005…45244494283158978561
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,755,311 XPM·at block #6,813,903 · 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.
Privacy Policy·

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