Block #1,435,614

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/30/2016, 2:32:56 AM · Difficulty 10.8107 · 5,381,397 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
82db48685df797b574896e4b87c2c01ff5b928a586b983075737216bd8055034

Height

#1,435,614

Difficulty

10.810715

Transactions

5

Size

8.29 KB

Version

2

Bits

0acf8b07

Nonce

222,019,571

Timestamp

1/30/2016, 2:32:56 AM

Confirmations

5,381,397

Merkle Root

2d697d0ce354e77c955b89c2ae93418a0aadc41707038e6c55babf6bb71a3a07
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.

2.253 × 10⁹⁵(96-digit number)
22531210983622767280…84924635426970828801
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
2.253 × 10⁹⁵(96-digit number)
22531210983622767280…84924635426970828801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.506 × 10⁹⁵(96-digit number)
45062421967245534560…69849270853941657601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.012 × 10⁹⁵(96-digit number)
90124843934491069120…39698541707883315201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.802 × 10⁹⁶(97-digit number)
18024968786898213824…79397083415766630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.604 × 10⁹⁶(97-digit number)
36049937573796427648…58794166831533260801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.209 × 10⁹⁶(97-digit number)
72099875147592855296…17588333663066521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.441 × 10⁹⁷(98-digit number)
14419975029518571059…35176667326133043201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.883 × 10⁹⁷(98-digit number)
28839950059037142118…70353334652266086401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.767 × 10⁹⁷(98-digit number)
57679900118074284237…40706669304532172801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.153 × 10⁹⁸(99-digit number)
11535980023614856847…81413338609064345601
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,780,120 XPM·at block #6,817,010 · 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