Block #455,042

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/22/2014, 8:13:32 AM · Difficulty 10.4018 · 6,354,336 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bef8a41e1e4e29bb0d3ef00a86ecd4e44226b95a6b2098a5de2526db942fc689

Height

#455,042

Difficulty

10.401798

Transactions

6

Size

1.29 KB

Version

2

Bits

0a66dc36

Nonce

185,774

Timestamp

3/22/2014, 8:13:32 AM

Confirmations

6,354,336

Merkle Root

a49b40a6b82441e5b99047c835705737b18de970b2a4127ed99201bd79ab9d0c
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.627 × 10⁹⁷(98-digit number)
16274057618658187262…03581365700045024001
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.627 × 10⁹⁷(98-digit number)
16274057618658187262…03581365700045024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.254 × 10⁹⁷(98-digit number)
32548115237316374525…07162731400090048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.509 × 10⁹⁷(98-digit number)
65096230474632749050…14325462800180096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.301 × 10⁹⁸(99-digit number)
13019246094926549810…28650925600360192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.603 × 10⁹⁸(99-digit number)
26038492189853099620…57301851200720384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.207 × 10⁹⁸(99-digit number)
52076984379706199240…14603702401440768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.041 × 10⁹⁹(100-digit number)
10415396875941239848…29207404802881536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.083 × 10⁹⁹(100-digit number)
20830793751882479696…58414809605763072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.166 × 10⁹⁹(100-digit number)
41661587503764959392…16829619211526144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.332 × 10⁹⁹(100-digit number)
83323175007529918784…33659238423052288001
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,094 XPM·at block #6,809,377 · 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