Block #2,253,382

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/16/2017, 12:08:46 AM · Difficulty 10.9491 · 4,573,625 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f36c87325a776b41d9a901142e8602c32a87c014902243c86b3a81ae7cc41b2f

Height

#2,253,382

Difficulty

10.949117

Transactions

73

Size

19.67 KB

Version

2

Bits

0af2f956

Nonce

689,969,620

Timestamp

8/16/2017, 12:08:46 AM

Confirmations

4,573,625

Merkle Root

995a61e6cf544458878eccb41c0d0ba57fe798a2b1ee070ab3c6ac59b9729ccf
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.585 × 10⁹³(94-digit number)
15852106713977252268…47134228686087008791
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.585 × 10⁹³(94-digit number)
15852106713977252268…47134228686087008791
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.170 × 10⁹³(94-digit number)
31704213427954504537…94268457372174017581
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.340 × 10⁹³(94-digit number)
63408426855909009074…88536914744348035161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.268 × 10⁹⁴(95-digit number)
12681685371181801814…77073829488696070321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.536 × 10⁹⁴(95-digit number)
25363370742363603629…54147658977392140641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.072 × 10⁹⁴(95-digit number)
50726741484727207259…08295317954784281281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.014 × 10⁹⁵(96-digit number)
10145348296945441451…16590635909568562561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.029 × 10⁹⁵(96-digit number)
20290696593890882903…33181271819137125121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.058 × 10⁹⁵(96-digit number)
40581393187781765807…66362543638274250241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.116 × 10⁹⁵(96-digit number)
81162786375563531615…32725087276548500481
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,860,232 XPM·at block #6,827,006 · 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