Block #421,791

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/27/2014, 7:18:13 AM · Difficulty 10.3753 · 6,393,084 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1181aeb4958c606143a29a39567c154ddb7a80c21faf9cbbfbda2be991a57c69

Height

#421,791

Difficulty

10.375292

Transactions

2

Size

1.47 KB

Version

2

Bits

0a60131b

Nonce

10,051

Timestamp

2/27/2014, 7:18:13 AM

Confirmations

6,393,084

Merkle Root

2df46663dd01fa753566dcbca59898087b4eb74080db621c8f9f25a1a7bc61b3
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.

5.657 × 10⁹⁴(95-digit number)
56577379287926157124…18075708308385280001
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
5.657 × 10⁹⁴(95-digit number)
56577379287926157124…18075708308385280001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.131 × 10⁹⁵(96-digit number)
11315475857585231424…36151416616770560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.263 × 10⁹⁵(96-digit number)
22630951715170462849…72302833233541120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.526 × 10⁹⁵(96-digit number)
45261903430340925699…44605666467082240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.052 × 10⁹⁵(96-digit number)
90523806860681851398…89211332934164480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.810 × 10⁹⁶(97-digit number)
18104761372136370279…78422665868328960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.620 × 10⁹⁶(97-digit number)
36209522744272740559…56845331736657920001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.241 × 10⁹⁶(97-digit number)
72419045488545481118…13690663473315840001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.448 × 10⁹⁷(98-digit number)
14483809097709096223…27381326946631680001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.896 × 10⁹⁷(98-digit number)
28967618195418192447…54762653893263360001
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,763,086 XPM·at block #6,814,874 · 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