Block #254,952

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/11/2013, 12:23:43 AM · Difficulty 9.9737 · 6,562,869 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e0d71e9a2b27b3845f7081fc57483721076f7b42a5d1ed02e2c41839ffefab20

Height

#254,952

Difficulty

9.973682

Transactions

8

Size

6.87 KB

Version

2

Bits

09f94338

Nonce

83,271

Timestamp

11/11/2013, 12:23:43 AM

Confirmations

6,562,869

Merkle Root

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

4.503 × 10⁹⁵(96-digit number)
45036969827850802653…80628878113429748801
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
4.503 × 10⁹⁵(96-digit number)
45036969827850802653…80628878113429748801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.007 × 10⁹⁵(96-digit number)
90073939655701605306…61257756226859497601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.801 × 10⁹⁶(97-digit number)
18014787931140321061…22515512453718995201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.602 × 10⁹⁶(97-digit number)
36029575862280642122…45031024907437990401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.205 × 10⁹⁶(97-digit number)
72059151724561284245…90062049814875980801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.441 × 10⁹⁷(98-digit number)
14411830344912256849…80124099629751961601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.882 × 10⁹⁷(98-digit number)
28823660689824513698…60248199259503923201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.764 × 10⁹⁷(98-digit number)
57647321379649027396…20496398519007846401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.152 × 10⁹⁸(99-digit number)
11529464275929805479…40992797038015692801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.305 × 10⁹⁸(99-digit number)
23058928551859610958…81985594076031385601
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,786,631 XPM·at block #6,817,820 · 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