Block #2,355,008

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/28/2017, 6:56:34 AM · Difficulty 10.8951 · 4,487,141 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4ebf68a42b372f4f9e332cd0ac23b7db105ba454384cc74a3eee1c7ab0824d4d

Height

#2,355,008

Difficulty

10.895105

Transactions

21

Size

8.39 KB

Version

2

Bits

0ae52596

Nonce

64,173,807

Timestamp

10/28/2017, 6:56:34 AM

Confirmations

4,487,141

Merkle Root

623d3439527fcb7c0629e113cf536f2d8999efdeef220348eb10756d878bf075
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.

1.125 × 10⁹⁵(96-digit number)
11257610278340559812…79851790672341268321
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
1.125 × 10⁹⁵(96-digit number)
11257610278340559812…79851790672341268321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.251 × 10⁹⁵(96-digit number)
22515220556681119625…59703581344682536641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.503 × 10⁹⁵(96-digit number)
45030441113362239251…19407162689365073281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.006 × 10⁹⁵(96-digit number)
90060882226724478502…38814325378730146561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.801 × 10⁹⁶(97-digit number)
18012176445344895700…77628650757460293121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.602 × 10⁹⁶(97-digit number)
36024352890689791401…55257301514920586241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.204 × 10⁹⁶(97-digit number)
72048705781379582802…10514603029841172481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.440 × 10⁹⁷(98-digit number)
14409741156275916560…21029206059682344961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.881 × 10⁹⁷(98-digit number)
28819482312551833120…42058412119364689921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.763 × 10⁹⁷(98-digit number)
57638964625103666241…84116824238729379841
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,981,581 XPM·at block #6,842,148 · 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