Block #642,019

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/21/2014, 10:06:23 AM · Difficulty 10.9570 · 6,167,709 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c47c10b19681517d81befda5082b11048f09d00a1cc4ce31a43d50f790d8044c

Height

#642,019

Difficulty

10.957046

Transactions

3

Size

91.00 KB

Version

2

Bits

0af500f9

Nonce

763,752,653

Timestamp

7/21/2014, 10:06:23 AM

Confirmations

6,167,709

Merkle Root

f25ee00a1853d3468628e14d5df45716675ff33a68ff0d2d776c0da914919214
Transactions (3)
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.

1.440 × 10⁹⁸(99-digit number)
14408452837571843518…87315882156930600961
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
1.440 × 10⁹⁸(99-digit number)
14408452837571843518…87315882156930600961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.881 × 10⁹⁸(99-digit number)
28816905675143687036…74631764313861201921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.763 × 10⁹⁸(99-digit number)
57633811350287374072…49263528627722403841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.152 × 10⁹⁹(100-digit number)
11526762270057474814…98527057255444807681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.305 × 10⁹⁹(100-digit number)
23053524540114949628…97054114510889615361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.610 × 10⁹⁹(100-digit number)
46107049080229899257…94108229021779230721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.221 × 10⁹⁹(100-digit number)
92214098160459798515…88216458043558461441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.844 × 10¹⁰⁰(101-digit number)
18442819632091959703…76432916087116922881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.688 × 10¹⁰⁰(101-digit number)
36885639264183919406…52865832174233845761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.377 × 10¹⁰⁰(101-digit number)
73771278528367838812…05731664348467691521
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,721,905 XPM·at block #6,809,727 · 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