Block #408,541

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/17/2014, 5:44:09 PM · Difficulty 10.4307 · 6,400,941 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fc0a5e6626fc0a272d4192b9bc91e91d44bdc7eaa2263d50038d0796b5b0c7aa

Height

#408,541

Difficulty

10.430694

Transactions

1

Size

901 B

Version

2

Bits

0a6e41f1

Nonce

8,202

Timestamp

2/17/2014, 5:44:09 PM

Confirmations

6,400,941

Merkle Root

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

4.042 × 10⁹⁵(96-digit number)
40421022906342835852…59022782088967129561
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
4.042 × 10⁹⁵(96-digit number)
40421022906342835852…59022782088967129561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.084 × 10⁹⁵(96-digit number)
80842045812685671704…18045564177934259121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.616 × 10⁹⁶(97-digit number)
16168409162537134340…36091128355868518241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.233 × 10⁹⁶(97-digit number)
32336818325074268681…72182256711737036481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.467 × 10⁹⁶(97-digit number)
64673636650148537363…44364513423474072961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.293 × 10⁹⁷(98-digit number)
12934727330029707472…88729026846948145921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.586 × 10⁹⁷(98-digit number)
25869454660059414945…77458053693896291841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.173 × 10⁹⁷(98-digit number)
51738909320118829890…54916107387792583681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.034 × 10⁹⁸(99-digit number)
10347781864023765978…09832214775585167361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.069 × 10⁹⁸(99-digit number)
20695563728047531956…19664429551170334721
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,719,927 XPM·at block #6,809,481 · 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.

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