Block #258,955

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/13/2013, 8:46:56 AM · Difficulty 9.9768 · 6,558,911 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0ff655962d78f9d9bab568f62d96fdb736bb60a9230ed833c16ec453b84ed69f

Height

#258,955

Difficulty

9.976839

Transactions

1

Size

2.14 KB

Version

2

Bits

09fa121f

Nonce

19,545

Timestamp

11/13/2013, 8:46:56 AM

Confirmations

6,558,911

Merkle Root

1d43081fb00b2c1f2baf840e07cec078d2502196bdd86ad65db9e851695dc740
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.923 × 10⁹⁵(96-digit number)
49238255065213075833…10424087614779444601
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.923 × 10⁹⁵(96-digit number)
49238255065213075833…10424087614779444601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.847 × 10⁹⁵(96-digit number)
98476510130426151666…20848175229558889201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.969 × 10⁹⁶(97-digit number)
19695302026085230333…41696350459117778401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.939 × 10⁹⁶(97-digit number)
39390604052170460666…83392700918235556801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.878 × 10⁹⁶(97-digit number)
78781208104340921332…66785401836471113601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.575 × 10⁹⁷(98-digit number)
15756241620868184266…33570803672942227201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.151 × 10⁹⁷(98-digit number)
31512483241736368533…67141607345884454401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.302 × 10⁹⁷(98-digit number)
63024966483472737066…34283214691768908801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.260 × 10⁹⁸(99-digit number)
12604993296694547413…68566429383537817601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.520 × 10⁹⁸(99-digit number)
25209986593389094826…37132858767075635201
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,995 XPM·at block #6,817,865 · 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