Block #247,982

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/7/2013, 2:43:48 AM · Difficulty 9.9653 · 6,559,982 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
db4cbac502b25672ac0b3c5401984c948e713d3eed3873dddbe0f777a7568e40

Height

#247,982

Difficulty

9.965317

Transactions

7

Size

2.81 KB

Version

2

Bits

09f71f0b

Nonce

207,402

Timestamp

11/7/2013, 2:43:48 AM

Confirmations

6,559,982

Merkle Root

76df755dbdde85cb44edcb5e11f4390d08504045f54a9a29a001de5b065981de
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.207 × 10⁹⁶(97-digit number)
32078692802319020688…35523194768206842561
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.207 × 10⁹⁶(97-digit number)
32078692802319020688…35523194768206842561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.415 × 10⁹⁶(97-digit number)
64157385604638041377…71046389536413685121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.283 × 10⁹⁷(98-digit number)
12831477120927608275…42092779072827370241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.566 × 10⁹⁷(98-digit number)
25662954241855216550…84185558145654740481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.132 × 10⁹⁷(98-digit number)
51325908483710433101…68371116291309480961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.026 × 10⁹⁸(99-digit number)
10265181696742086620…36742232582618961921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.053 × 10⁹⁸(99-digit number)
20530363393484173240…73484465165237923841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.106 × 10⁹⁸(99-digit number)
41060726786968346481…46968930330475847681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.212 × 10⁹⁸(99-digit number)
82121453573936692963…93937860660951695361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.642 × 10⁹⁹(100-digit number)
16424290714787338592…87875721321903390721
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,707,755 XPM·at block #6,807,963 · 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