Block #412,956

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/20/2014, 9:20:57 PM · Difficulty 10.4190 · 6,401,403 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6a34f9b0c4b774e2f3528fea4cf75a9420da0a7caa3cdb40234849d4485cecde

Height

#412,956

Difficulty

10.419048

Transactions

5

Size

1.08 KB

Version

2

Bits

0a6b46b9

Nonce

93,796

Timestamp

2/20/2014, 9:20:57 PM

Confirmations

6,401,403

Merkle Root

c3a2eb5dc402a75ea60ecfb26d2068dba3b7b93969f67861f79fec3818d8c75c
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.024 × 10⁹⁷(98-digit number)
20240632133615823540…46377963870367233281
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.024 × 10⁹⁷(98-digit number)
20240632133615823540…46377963870367233281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.048 × 10⁹⁷(98-digit number)
40481264267231647080…92755927740734466561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.096 × 10⁹⁷(98-digit number)
80962528534463294160…85511855481468933121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.619 × 10⁹⁸(99-digit number)
16192505706892658832…71023710962937866241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.238 × 10⁹⁸(99-digit number)
32385011413785317664…42047421925875732481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.477 × 10⁹⁸(99-digit number)
64770022827570635328…84094843851751464961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.295 × 10⁹⁹(100-digit number)
12954004565514127065…68189687703502929921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.590 × 10⁹⁹(100-digit number)
25908009131028254131…36379375407005859841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.181 × 10⁹⁹(100-digit number)
51816018262056508262…72758750814011719681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.036 × 10¹⁰⁰(101-digit number)
10363203652411301652…45517501628023439361
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,758,938 XPM·at block #6,814,358 · 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