Block #412,107

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/20/2014, 7:36:50 AM · Difficulty 10.4158 · 6,394,158 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c5fa1d3f3394c7b136ecd77483cda3c4cad7427476c5bb96daabf6666e5a92b5

Height

#412,107

Difficulty

10.415776

Transactions

2

Size

1.62 KB

Version

2

Bits

0a6a7049

Nonce

27,974,894

Timestamp

2/20/2014, 7:36:50 AM

Confirmations

6,394,158

Merkle Root

2c5cc66c07d34359416741c7627def922266209d9195c383e21e78e0b2c60c37
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.665 × 10⁹⁷(98-digit number)
26650940317318383081…18891262243126272001
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.665 × 10⁹⁷(98-digit number)
26650940317318383081…18891262243126272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.330 × 10⁹⁷(98-digit number)
53301880634636766163…37782524486252544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.066 × 10⁹⁸(99-digit number)
10660376126927353232…75565048972505088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.132 × 10⁹⁸(99-digit number)
21320752253854706465…51130097945010176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.264 × 10⁹⁸(99-digit number)
42641504507709412930…02260195890020352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.528 × 10⁹⁸(99-digit number)
85283009015418825861…04520391780040704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.705 × 10⁹⁹(100-digit number)
17056601803083765172…09040783560081408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.411 × 10⁹⁹(100-digit number)
34113203606167530344…18081567120162816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.822 × 10⁹⁹(100-digit number)
68226407212335060689…36163134240325632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.364 × 10¹⁰⁰(101-digit number)
13645281442467012137…72326268480651264001
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,694,205 XPM·at block #6,806,264 · 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