Block #236,394

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/31/2013, 11:34:32 AM · Difficulty 9.9474 · 6,590,274 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0dcaa9ee91ad1efdeb1b3cb33f0f216bbecdf6876e342ba2bda9d4ba4f9bbebf

Height

#236,394

Difficulty

9.947410

Transactions

1

Size

1.01 KB

Version

2

Bits

09f28976

Nonce

54,158

Timestamp

10/31/2013, 11:34:32 AM

Confirmations

6,590,274

Merkle Root

48c5a28175b208904c96521c9d2e333a65b98aa9b59c20f15dd0ecc1bc48aedf
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.

8.927 × 10⁹²(93-digit number)
89277566772386001181…04272528424490387201
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
8.927 × 10⁹²(93-digit number)
89277566772386001181…04272528424490387201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.785 × 10⁹³(94-digit number)
17855513354477200236…08545056848980774401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.571 × 10⁹³(94-digit number)
35711026708954400472…17090113697961548801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.142 × 10⁹³(94-digit number)
71422053417908800945…34180227395923097601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.428 × 10⁹⁴(95-digit number)
14284410683581760189…68360454791846195201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.856 × 10⁹⁴(95-digit number)
28568821367163520378…36720909583692390401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.713 × 10⁹⁴(95-digit number)
57137642734327040756…73441819167384780801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.142 × 10⁹⁵(96-digit number)
11427528546865408151…46883638334769561601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.285 × 10⁹⁵(96-digit number)
22855057093730816302…93767276669539123201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.571 × 10⁹⁵(96-digit number)
45710114187461632605…87534553339078246401
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,857,491 XPM·at block #6,826,667 · 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