Block #638,975

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/19/2014, 12:24:03 AM · Difficulty 10.9604 · 6,176,105 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
017754dbed549fc34f63c70d492ef80f5496f173307e2fa52d3cc2f9602c7797

Height

#638,975

Difficulty

10.960375

Transactions

11

Size

3.42 KB

Version

2

Bits

0af5db27

Nonce

538,388,500

Timestamp

7/19/2014, 12:24:03 AM

Confirmations

6,176,105

Merkle Root

9b81ec9261da257e38e1df60f51c79619923a9dcf72c679b23e3ded54baa5673
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.100 × 10⁹⁵(96-digit number)
71001450502616992743…57923868926252504921
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.100 × 10⁹⁵(96-digit number)
71001450502616992743…57923868926252504921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.420 × 10⁹⁶(97-digit number)
14200290100523398548…15847737852505009841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.840 × 10⁹⁶(97-digit number)
28400580201046797097…31695475705010019681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.680 × 10⁹⁶(97-digit number)
56801160402093594195…63390951410020039361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.136 × 10⁹⁷(98-digit number)
11360232080418718839…26781902820040078721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.272 × 10⁹⁷(98-digit number)
22720464160837437678…53563805640080157441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.544 × 10⁹⁷(98-digit number)
45440928321674875356…07127611280160314881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.088 × 10⁹⁷(98-digit number)
90881856643349750712…14255222560320629761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.817 × 10⁹⁸(99-digit number)
18176371328669950142…28510445120641259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.635 × 10⁹⁸(99-digit number)
36352742657339900284…57020890241282519041
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,764,726 XPM·at block #6,815,079 · 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