Block #2,915,450

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/9/2018, 12:53:23 AM · Difficulty 11.4511 · 3,918,288 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3863c1eb04d8e84b2f4c7370205908a0ce88f85fa459cce76ea50ae0279ad597

Height

#2,915,450

Difficulty

11.451103

Transactions

2

Size

2.00 KB

Version

2

Bits

0b737b83

Nonce

1,247,281,912

Timestamp

11/9/2018, 12:53:23 AM

Confirmations

3,918,288

Merkle Root

3413c7e9c735522dcc6cf35523602c16f179dd146013c2610a2ead32f9018519
Transactions (2)
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.108 × 10⁹⁴(95-digit number)
11081000623471289229…09734220328503073249
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.108 × 10⁹⁴(95-digit number)
11081000623471289229…09734220328503073249
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.216 × 10⁹⁴(95-digit number)
22162001246942578459…19468440657006146499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.432 × 10⁹⁴(95-digit number)
44324002493885156919…38936881314012292999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.864 × 10⁹⁴(95-digit number)
88648004987770313838…77873762628024585999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.772 × 10⁹⁵(96-digit number)
17729600997554062767…55747525256049171999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.545 × 10⁹⁵(96-digit number)
35459201995108125535…11495050512098343999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.091 × 10⁹⁵(96-digit number)
70918403990216251071…22990101024196687999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.418 × 10⁹⁶(97-digit number)
14183680798043250214…45980202048393375999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.836 × 10⁹⁶(97-digit number)
28367361596086500428…91960404096786751999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.673 × 10⁹⁶(97-digit number)
56734723192173000856…83920808193573503999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.134 × 10⁹⁷(98-digit number)
11346944638434600171…67841616387147007999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,914,121 XPM·at block #6,833,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