Block #244,924

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/5/2013, 4:14:18 AM · Difficulty 9.9633 · 6,561,588 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
da1316e8240578b838dfcc7800aa9c2b7cd63aee89b64cdbf3be18fe97ac3540

Height

#244,924

Difficulty

9.963284

Transactions

4

Size

4.43 KB

Version

2

Bits

09f699c7

Nonce

45,938

Timestamp

11/5/2013, 4:14:18 AM

Confirmations

6,561,588

Merkle Root

52e8086f3d5ff632de1bc20bb81779d243d07ba68481dd079685d939cc2d2838
Transactions (4)
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.242 × 10⁸⁸(89-digit number)
12426554445858124795…63713968829674455041
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.242 × 10⁸⁸(89-digit number)
12426554445858124795…63713968829674455041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.485 × 10⁸⁸(89-digit number)
24853108891716249591…27427937659348910081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.970 × 10⁸⁸(89-digit number)
49706217783432499182…54855875318697820161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.941 × 10⁸⁸(89-digit number)
99412435566864998364…09711750637395640321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.988 × 10⁸⁹(90-digit number)
19882487113372999672…19423501274791280641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.976 × 10⁸⁹(90-digit number)
39764974226745999345…38847002549582561281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.952 × 10⁸⁹(90-digit number)
79529948453491998691…77694005099165122561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.590 × 10⁹⁰(91-digit number)
15905989690698399738…55388010198330245121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.181 × 10⁹⁰(91-digit number)
31811979381396799476…10776020396660490241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.362 × 10⁹⁰(91-digit number)
63623958762793598953…21552040793320980481
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,696,193 XPM·at block #6,806,511 · 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