Block #435,640

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/9/2014, 2:08:23 AM · Difficulty 10.3521 · 6,405,481 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2dce770193bea0a8a3ea775ff1651b60f82c29409025be037f72e6629fd03f16

Height

#435,640

Difficulty

10.352061

Transactions

1

Size

1005 B

Version

2

Bits

0a5a20ad

Nonce

211,315

Timestamp

3/9/2014, 2:08:23 AM

Confirmations

6,405,481

Merkle Root

e63ea60d4ef7f2919aa92b4cd0a5db0dcc43ae750304ded0657b988873c90fc1
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.

3.651 × 10¹⁰⁰(101-digit number)
36516613921262064218…21972621941714006401
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
3.651 × 10¹⁰⁰(101-digit number)
36516613921262064218…21972621941714006401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.303 × 10¹⁰⁰(101-digit number)
73033227842524128437…43945243883428012801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.460 × 10¹⁰¹(102-digit number)
14606645568504825687…87890487766856025601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.921 × 10¹⁰¹(102-digit number)
29213291137009651375…75780975533712051201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.842 × 10¹⁰¹(102-digit number)
58426582274019302750…51561951067424102401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.168 × 10¹⁰²(103-digit number)
11685316454803860550…03123902134848204801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.337 × 10¹⁰²(103-digit number)
23370632909607721100…06247804269696409601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.674 × 10¹⁰²(103-digit number)
46741265819215442200…12495608539392819201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.348 × 10¹⁰²(103-digit number)
93482531638430884400…24991217078785638401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.869 × 10¹⁰³(104-digit number)
18696506327686176880…49982434157571276801
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,973,336 XPM·at block #6,841,120 · 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