Block #457,758

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2014, 3:20:57 AM · Difficulty 10.4191 · 6,369,547 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d4d1e6622799f5d4f8d731e7cf701e755ae8ad7765daeab76af42c1afb24aa27

Height

#457,758

Difficulty

10.419058

Transactions

9

Size

2.19 KB

Version

2

Bits

0a6b475e

Nonce

7,794

Timestamp

3/24/2014, 3:20:57 AM

Confirmations

6,369,547

Merkle Root

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

3.393 × 10⁹⁶(97-digit number)
33935165823519036575…13771211477097563551
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
3.393 × 10⁹⁶(97-digit number)
33935165823519036575…13771211477097563551
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.787 × 10⁹⁶(97-digit number)
67870331647038073151…27542422954195127101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.357 × 10⁹⁷(98-digit number)
13574066329407614630…55084845908390254201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.714 × 10⁹⁷(98-digit number)
27148132658815229260…10169691816780508401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.429 × 10⁹⁷(98-digit number)
54296265317630458521…20339383633561016801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.085 × 10⁹⁸(99-digit number)
10859253063526091704…40678767267122033601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.171 × 10⁹⁸(99-digit number)
21718506127052183408…81357534534244067201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.343 × 10⁹⁸(99-digit number)
43437012254104366817…62715069068488134401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.687 × 10⁹⁸(99-digit number)
86874024508208733634…25430138136976268801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.737 × 10⁹⁹(100-digit number)
17374804901641746726…50860276273952537601
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,862,551 XPM·at block #6,827,304 · 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