Block #2,913,200

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/7/2018, 4:02:56 AM · Difficulty 11.4971 · 3,918,538 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
289202a87f4ca6b2710c9f0109facc01a1e5ea69206ea6fba6180c2f8b68e549

Height

#2,913,200

Difficulty

11.497102

Transactions

5

Size

2.24 KB

Version

2

Bits

0b7f420d

Nonce

652,310,239

Timestamp

11/7/2018, 4:02:56 AM

Confirmations

3,918,538

Merkle Root

7ec3d7706bc1051dcc5075b8b9d7bddc200cdeaf8f2a32d02ba72061c8e3bd9d
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.616 × 10⁹³(94-digit number)
26164968517358946234…88529914599610804961
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.616 × 10⁹³(94-digit number)
26164968517358946234…88529914599610804961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.232 × 10⁹³(94-digit number)
52329937034717892469…77059829199221609921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.046 × 10⁹⁴(95-digit number)
10465987406943578493…54119658398443219841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.093 × 10⁹⁴(95-digit number)
20931974813887156987…08239316796886439681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.186 × 10⁹⁴(95-digit number)
41863949627774313975…16478633593772879361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.372 × 10⁹⁴(95-digit number)
83727899255548627951…32957267187545758721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.674 × 10⁹⁵(96-digit number)
16745579851109725590…65914534375091517441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.349 × 10⁹⁵(96-digit number)
33491159702219451180…31829068750183034881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.698 × 10⁹⁵(96-digit number)
66982319404438902361…63658137500366069761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.339 × 10⁹⁶(97-digit number)
13396463880887780472…27316275000732139521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.679 × 10⁹⁶(97-digit number)
26792927761775560944…54632550001464279041
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,898,009 XPM·at block #6,831,737 · 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