Block #2,639,948

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2018, 8:15:41 PM · Difficulty 11.5597 · 4,190,875 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
35562b80f5876dadbc109e30abe238cc171fee8b4dcafc518fd07e8cff60fa8e

Height

#2,639,948

Difficulty

11.559737

Transactions

21

Size

5.20 KB

Version

2

Bits

0b8f4ae9

Nonce

218,277,165

Timestamp

4/30/2018, 8:15:41 PM

Confirmations

4,190,875

Merkle Root

07aa5a6d92b373aed29fa4078f8ca2e656e01a3c42996304f6b386fe1c5beaf6
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.874 × 10⁹⁵(96-digit number)
18740684734855095108…87603514888832659839
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.874 × 10⁹⁵(96-digit number)
18740684734855095108…87603514888832659839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.748 × 10⁹⁵(96-digit number)
37481369469710190217…75207029777665319679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.496 × 10⁹⁵(96-digit number)
74962738939420380434…50414059555330639359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.499 × 10⁹⁶(97-digit number)
14992547787884076086…00828119110661278719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.998 × 10⁹⁶(97-digit number)
29985095575768152173…01656238221322557439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.997 × 10⁹⁶(97-digit number)
59970191151536304347…03312476442645114879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.199 × 10⁹⁷(98-digit number)
11994038230307260869…06624952885290229759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.398 × 10⁹⁷(98-digit number)
23988076460614521739…13249905770580459519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.797 × 10⁹⁷(98-digit number)
47976152921229043478…26499811541160919039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.595 × 10⁹⁷(98-digit number)
95952305842458086956…52999623082321838079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.919 × 10⁹⁸(99-digit number)
19190461168491617391…05999246164643676159
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,717 XPM·at block #6,830,822 · 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