Block #410,656

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/19/2014, 5:22:51 AM · Difficulty 10.4296 · 6,415,992 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ffa406dd801e7c4c915f03e0d2a94881cb9553f4389b484ad60dbcc320403bdb

Height

#410,656

Difficulty

10.429611

Transactions

2

Size

3.73 KB

Version

2

Bits

0a6dfaf8

Nonce

352,330,796

Timestamp

2/19/2014, 5:22:51 AM

Confirmations

6,415,992

Merkle Root

26bca5439238cd15590f3974feef9e588cba4ec8e5776b081b38162449703759
Transactions (2)
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.114 × 10⁹⁶(97-digit number)
21143092827835435218…07710108659014533761
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.114 × 10⁹⁶(97-digit number)
21143092827835435218…07710108659014533761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.228 × 10⁹⁶(97-digit number)
42286185655670870436…15420217318029067521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.457 × 10⁹⁶(97-digit number)
84572371311341740873…30840434636058135041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.691 × 10⁹⁷(98-digit number)
16914474262268348174…61680869272116270081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.382 × 10⁹⁷(98-digit number)
33828948524536696349…23361738544232540161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.765 × 10⁹⁷(98-digit number)
67657897049073392698…46723477088465080321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.353 × 10⁹⁸(99-digit number)
13531579409814678539…93446954176930160641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.706 × 10⁹⁸(99-digit number)
27063158819629357079…86893908353860321281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.412 × 10⁹⁸(99-digit number)
54126317639258714158…73787816707720642561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.082 × 10⁹⁹(100-digit number)
10825263527851742831…47575633415441285121
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,857,332 XPM·at block #6,826,647 · 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