Block #639,080

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/19/2014, 2:21:16 AM · Difficulty 10.9603 · 6,188,108 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8296e4ec232dc3c585b641fbc6212430f22b85a58c7e7d366e91ff0c55b31375

Height

#639,080

Difficulty

10.960297

Transactions

6

Size

1.74 KB

Version

2

Bits

0af5d60d

Nonce

719,496,516

Timestamp

7/19/2014, 2:21:16 AM

Confirmations

6,188,108

Merkle Root

57e3d43665ddcf979c575b4b988f143ccb05be936824f5f795ef0e8803393beb
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.367 × 10⁹⁵(96-digit number)
13675014956806196628…54914580626071221651
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.367 × 10⁹⁵(96-digit number)
13675014956806196628…54914580626071221651
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.735 × 10⁹⁵(96-digit number)
27350029913612393256…09829161252142443301
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.470 × 10⁹⁵(96-digit number)
54700059827224786513…19658322504284886601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.094 × 10⁹⁶(97-digit number)
10940011965444957302…39316645008569773201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.188 × 10⁹⁶(97-digit number)
21880023930889914605…78633290017139546401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.376 × 10⁹⁶(97-digit number)
43760047861779829210…57266580034279092801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.752 × 10⁹⁶(97-digit number)
87520095723559658421…14533160068558185601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.750 × 10⁹⁷(98-digit number)
17504019144711931684…29066320137116371201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.500 × 10⁹⁷(98-digit number)
35008038289423863368…58132640274232742401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.001 × 10⁹⁷(98-digit number)
70016076578847726736…16265280548465484801
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,861,601 XPM·at block #6,827,187 · 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