Block #640,874

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/20/2014, 1:23:58 PM · Difficulty 10.9578 · 6,172,989 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8536c6a1d5e132bb3f2f588419eb7ced35ad02e3a35a760ad024b5abea3e9a16

Height

#640,874

Difficulty

10.957829

Transactions

3

Size

625 B

Version

2

Bits

0af5344b

Nonce

38,218,102

Timestamp

7/20/2014, 1:23:58 PM

Confirmations

6,172,989

Merkle Root

3926028ac3a26da6f870cf4bec697440360897b058d491851cf8e1690dfa9b90
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.

7.290 × 10⁹⁵(96-digit number)
72900589024050068225…98761968485284044801
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
7.290 × 10⁹⁵(96-digit number)
72900589024050068225…98761968485284044801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.458 × 10⁹⁶(97-digit number)
14580117804810013645…97523936970568089601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.916 × 10⁹⁶(97-digit number)
29160235609620027290…95047873941136179201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.832 × 10⁹⁶(97-digit number)
58320471219240054580…90095747882272358401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.166 × 10⁹⁷(98-digit number)
11664094243848010916…80191495764544716801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.332 × 10⁹⁷(98-digit number)
23328188487696021832…60382991529089433601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.665 × 10⁹⁷(98-digit number)
46656376975392043664…20765983058178867201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.331 × 10⁹⁷(98-digit number)
93312753950784087328…41531966116357734401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.866 × 10⁹⁸(99-digit number)
18662550790156817465…83063932232715468801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.732 × 10⁹⁸(99-digit number)
37325101580313634931…66127864465430937601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.465 × 10⁹⁸(99-digit number)
74650203160627269862…32255728930861875201
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,754,976 XPM·at block #6,813,862 · 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