Block #2,637,622

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/29/2018, 11:58:34 PM · Difficulty 11.4513 · 4,202,231 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
02cde11f239ee4c36ca184836e820b37ccd428becd0dbf2e3fc432f40d7d83e5

Height

#2,637,622

Difficulty

11.451274

Transactions

5

Size

1.01 KB

Version

2

Bits

0b7386b7

Nonce

92,782,547

Timestamp

4/29/2018, 11:58:34 PM

Confirmations

4,202,231

Merkle Root

e5023e993cdbee57ca1ce09f8377899b09a131689b90ed5bb5ae15a5daf3bd40
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.002 × 10⁹⁴(95-digit number)
20026387852018659497…07399952232316085119
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.002 × 10⁹⁴(95-digit number)
20026387852018659497…07399952232316085119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.005 × 10⁹⁴(95-digit number)
40052775704037318994…14799904464632170239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.010 × 10⁹⁴(95-digit number)
80105551408074637988…29599808929264340479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.602 × 10⁹⁵(96-digit number)
16021110281614927597…59199617858528680959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.204 × 10⁹⁵(96-digit number)
32042220563229855195…18399235717057361919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.408 × 10⁹⁵(96-digit number)
64084441126459710390…36798471434114723839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.281 × 10⁹⁶(97-digit number)
12816888225291942078…73596942868229447679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.563 × 10⁹⁶(97-digit number)
25633776450583884156…47193885736458895359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.126 × 10⁹⁶(97-digit number)
51267552901167768312…94387771472917790719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.025 × 10⁹⁷(98-digit number)
10253510580233553662…88775542945835581439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.050 × 10⁹⁷(98-digit number)
20507021160467107325…77551085891671162879
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,963,124 XPM·at block #6,839,852 · 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