Block #635,867

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/16/2014, 12:31:46 PM · Difficulty 10.9639 · 6,173,293 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cc4500eeb9e2b0c49e0a311f78bfda7f2ed94ba07d9f5c62bc51ea7a6860ddbe

Height

#635,867

Difficulty

10.963906

Transactions

3

Size

957 B

Version

2

Bits

0af6c288

Nonce

282,020,886

Timestamp

7/16/2014, 12:31:46 PM

Confirmations

6,173,293

Merkle Root

5a6243b3833c1e228e8429c5a867c59b99652b51a15292070f2d2dcaca35c66c
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.

4.780 × 10⁹⁶(97-digit number)
47806836834275498736…09384268631727558321
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
4.780 × 10⁹⁶(97-digit number)
47806836834275498736…09384268631727558321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.561 × 10⁹⁶(97-digit number)
95613673668550997472…18768537263455116641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.912 × 10⁹⁷(98-digit number)
19122734733710199494…37537074526910233281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.824 × 10⁹⁷(98-digit number)
38245469467420398988…75074149053820466561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.649 × 10⁹⁷(98-digit number)
76490938934840797977…50148298107640933121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.529 × 10⁹⁸(99-digit number)
15298187786968159595…00296596215281866241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.059 × 10⁹⁸(99-digit number)
30596375573936319191…00593192430563732481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.119 × 10⁹⁸(99-digit number)
61192751147872638382…01186384861127464961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.223 × 10⁹⁹(100-digit number)
12238550229574527676…02372769722254929921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.447 × 10⁹⁹(100-digit number)
24477100459149055352…04745539444509859841
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,717,341 XPM·at block #6,809,159 · 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