Block #239,186

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/1/2013, 10:54:11 PM · Difficulty 9.9541 · 6,591,857 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b9d3ce8c1bafbdfd87f02227c5c732f926e712593d1cc991c9134df541c2bff3

Height

#239,186

Difficulty

9.954066

Transactions

1

Size

1.94 KB

Version

2

Bits

09f43daf

Nonce

77,811

Timestamp

11/1/2013, 10:54:11 PM

Confirmations

6,591,857

Merkle Root

6e36e261e02f99a0cc9cbbd4cad373182d95875a67041ae234ce584ad38bc36a
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.599 × 10⁹³(94-digit number)
35994742475069220235…67505004202244262401
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.599 × 10⁹³(94-digit number)
35994742475069220235…67505004202244262401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.198 × 10⁹³(94-digit number)
71989484950138440471…35010008404488524801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.439 × 10⁹⁴(95-digit number)
14397896990027688094…70020016808977049601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.879 × 10⁹⁴(95-digit number)
28795793980055376188…40040033617954099201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.759 × 10⁹⁴(95-digit number)
57591587960110752377…80080067235908198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.151 × 10⁹⁵(96-digit number)
11518317592022150475…60160134471816396801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.303 × 10⁹⁵(96-digit number)
23036635184044300950…20320268943632793601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.607 × 10⁹⁵(96-digit number)
46073270368088601901…40640537887265587201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.214 × 10⁹⁵(96-digit number)
92146540736177203803…81281075774531174401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.842 × 10⁹⁶(97-digit number)
18429308147235440760…62562151549062348801
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,892,481 XPM·at block #6,831,042 · 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