Block #414,910

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/22/2014, 8:46:18 AM · Difficulty 10.3995 · 6,409,817 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ad0ef7b864f7539b947388a26a16fd8a6a6693fbf0887fc5941674804863bdd4

Height

#414,910

Difficulty

10.399451

Transactions

5

Size

1.92 KB

Version

2

Bits

0a664268

Nonce

160,506

Timestamp

2/22/2014, 8:46:18 AM

Confirmations

6,409,817

Merkle Root

3d81cf776b512f8c0bc9b5f376f5f3a6a76ffac6613204e72012e34c327968bd
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.040 × 10¹⁰¹(102-digit number)
40408331867380610048…90559447055246192641
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.040 × 10¹⁰¹(102-digit number)
40408331867380610048…90559447055246192641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.081 × 10¹⁰¹(102-digit number)
80816663734761220096…81118894110492385281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.616 × 10¹⁰²(103-digit number)
16163332746952244019…62237788220984770561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.232 × 10¹⁰²(103-digit number)
32326665493904488038…24475576441969541121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.465 × 10¹⁰²(103-digit number)
64653330987808976077…48951152883939082241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.293 × 10¹⁰³(104-digit number)
12930666197561795215…97902305767878164481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.586 × 10¹⁰³(104-digit number)
25861332395123590430…95804611535756328961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.172 × 10¹⁰³(104-digit number)
51722664790247180861…91609223071512657921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.034 × 10¹⁰⁴(105-digit number)
10344532958049436172…83218446143025315841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.068 × 10¹⁰⁴(105-digit number)
20689065916098872344…66436892286050631681
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,841,883 XPM·at block #6,824,726 · 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