Block #452,181

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/20/2014, 10:12:49 AM · Difficulty 10.3886 · 6,356,451 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1caaabbf548146b99f8e057939bb781c117a38f38c79141547d9c402361a4fc4

Height

#452,181

Difficulty

10.388600

Transactions

2

Size

19.11 KB

Version

2

Bits

0a637b48

Nonce

563,421

Timestamp

3/20/2014, 10:12:49 AM

Confirmations

6,356,451

Merkle Root

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

1.067 × 10⁹⁵(96-digit number)
10675287186620648551…51072151779152828161
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
1.067 × 10⁹⁵(96-digit number)
10675287186620648551…51072151779152828161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.135 × 10⁹⁵(96-digit number)
21350574373241297103…02144303558305656321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.270 × 10⁹⁵(96-digit number)
42701148746482594206…04288607116611312641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.540 × 10⁹⁵(96-digit number)
85402297492965188412…08577214233222625281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.708 × 10⁹⁶(97-digit number)
17080459498593037682…17154428466445250561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.416 × 10⁹⁶(97-digit number)
34160918997186075364…34308856932890501121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.832 × 10⁹⁶(97-digit number)
68321837994372150729…68617713865781002241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.366 × 10⁹⁷(98-digit number)
13664367598874430145…37235427731562004481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.732 × 10⁹⁷(98-digit number)
27328735197748860291…74470855463124008961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.465 × 10⁹⁷(98-digit number)
54657470395497720583…48941710926248017921
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,713,106 XPM·at block #6,808,631 · 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