Block #2,637,985

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2018, 3:07:16 AM · Difficulty 11.4698 · 4,192,752 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cb5cc8face4b93b9e52e63614efb3bfb71a942ed3547145ec2568df665b08f3d

Height

#2,637,985

Difficulty

11.469836

Transactions

67

Size

18.45 KB

Version

2

Bits

0b784724

Nonce

208,872,286

Timestamp

4/30/2018, 3:07:16 AM

Confirmations

4,192,752

Merkle Root

45b6b96dcaf60963cfa5b0128c1cfffb8474c19920d4c24c0bf1a729ed671599
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.182 × 10⁹⁶(97-digit number)
11823094199177032327…85114060601361123199
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.182 × 10⁹⁶(97-digit number)
11823094199177032327…85114060601361123199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.364 × 10⁹⁶(97-digit number)
23646188398354064655…70228121202722246399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.729 × 10⁹⁶(97-digit number)
47292376796708129311…40456242405444492799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.458 × 10⁹⁶(97-digit number)
94584753593416258622…80912484810888985599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.891 × 10⁹⁷(98-digit number)
18916950718683251724…61824969621777971199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.783 × 10⁹⁷(98-digit number)
37833901437366503449…23649939243555942399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.566 × 10⁹⁷(98-digit number)
75667802874733006898…47299878487111884799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.513 × 10⁹⁸(99-digit number)
15133560574946601379…94599756974223769599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.026 × 10⁹⁸(99-digit number)
30267121149893202759…89199513948447539199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.053 × 10⁹⁸(99-digit number)
60534242299786405518…78399027896895078399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.210 × 10⁹⁹(100-digit number)
12106848459957281103…56798055793790156799
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,890,033 XPM·at block #6,830,736 · 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