Block #2,335,159

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/13/2017, 12:09:56 PM · Difficulty 10.9206 · 4,498,757 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
39e9eb1274ac3a2a073fb74c373483824b20a9f25ac23cd3ea2ad91446a3cb08

Height

#2,335,159

Difficulty

10.920601

Transactions

38

Size

9.82 KB

Version

2

Bits

0aebac86

Nonce

741,082,020

Timestamp

10/13/2017, 12:09:56 PM

Confirmations

4,498,757

Merkle Root

79c456b05b8154f211679db493fb52d152ad0631242ef241b549a763802c1f36
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.

2.874 × 10⁹⁵(96-digit number)
28744295337480060332…48498966132044533761
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
2.874 × 10⁹⁵(96-digit number)
28744295337480060332…48498966132044533761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.748 × 10⁹⁵(96-digit number)
57488590674960120664…96997932264089067521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.149 × 10⁹⁶(97-digit number)
11497718134992024132…93995864528178135041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.299 × 10⁹⁶(97-digit number)
22995436269984048265…87991729056356270081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.599 × 10⁹⁶(97-digit number)
45990872539968096531…75983458112712540161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.198 × 10⁹⁶(97-digit number)
91981745079936193063…51966916225425080321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.839 × 10⁹⁷(98-digit number)
18396349015987238612…03933832450850160641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.679 × 10⁹⁷(98-digit number)
36792698031974477225…07867664901700321281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.358 × 10⁹⁷(98-digit number)
73585396063948954450…15735329803400642561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.471 × 10⁹⁸(99-digit number)
14717079212789790890…31470659606801285121
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,915,554 XPM·at block #6,833,915 · 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