Block #636,486

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/16/2014, 11:12:05 PM · Difficulty 10.9638 · 6,178,401 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
22ab9cbae5c747d70c71c7872161a4a2bb275474670665dc0c22b7623b94ff49

Height

#636,486

Difficulty

10.963759

Transactions

5

Size

1.09 KB

Version

2

Bits

0af6b8e1

Nonce

143,326,958

Timestamp

7/16/2014, 11:12:05 PM

Confirmations

6,178,401

Merkle Root

5c3846e37dcdfc16a7084e5c19dd692843981fedd0b0817e849a90387217a0df
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.472 × 10⁹⁷(98-digit number)
14726665643562053938…70211871243928064001
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.472 × 10⁹⁷(98-digit number)
14726665643562053938…70211871243928064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.945 × 10⁹⁷(98-digit number)
29453331287124107877…40423742487856128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.890 × 10⁹⁷(98-digit number)
58906662574248215754…80847484975712256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.178 × 10⁹⁸(99-digit number)
11781332514849643150…61694969951424512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.356 × 10⁹⁸(99-digit number)
23562665029699286301…23389939902849024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.712 × 10⁹⁸(99-digit number)
47125330059398572603…46779879805698048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.425 × 10⁹⁸(99-digit number)
94250660118797145207…93559759611396096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.885 × 10⁹⁹(100-digit number)
18850132023759429041…87119519222792192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.770 × 10⁹⁹(100-digit number)
37700264047518858083…74239038445584384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.540 × 10⁹⁹(100-digit number)
75400528095037716166…48478076891168768001
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,763,184 XPM·at block #6,814,886 · 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