Block #2,634,747

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/29/2018, 12:23:58 AM · Difficulty 11.2665 · 4,206,086 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
63659ffb391edb975b852d2b76f5c66f8958a2e8c1255afb56d2648560caf0f9

Height

#2,634,747

Difficulty

11.266516

Transactions

2

Size

1.43 KB

Version

2

Bits

0b443a61

Nonce

93,079,283

Timestamp

4/29/2018, 12:23:58 AM

Confirmations

4,206,086

Merkle Root

07879f236055aba7b71ae46ea1116871c8b61f4dbfbeeb4f463510047258932c
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.

2.240 × 10⁹⁶(97-digit number)
22403708053173243663…32541465759928500479
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.240 × 10⁹⁶(97-digit number)
22403708053173243663…32541465759928500479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.480 × 10⁹⁶(97-digit number)
44807416106346487326…65082931519857000959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.961 × 10⁹⁶(97-digit number)
89614832212692974652…30165863039714001919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.792 × 10⁹⁷(98-digit number)
17922966442538594930…60331726079428003839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.584 × 10⁹⁷(98-digit number)
35845932885077189861…20663452158856007679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.169 × 10⁹⁷(98-digit number)
71691865770154379722…41326904317712015359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.433 × 10⁹⁸(99-digit number)
14338373154030875944…82653808635424030719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.867 × 10⁹⁸(99-digit number)
28676746308061751888…65307617270848061439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.735 × 10⁹⁸(99-digit number)
57353492616123503777…30615234541696122879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.147 × 10⁹⁹(100-digit number)
11470698523224700755…61230469083392245759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.294 × 10⁹⁹(100-digit number)
22941397046449401511…22460938166784491519
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,971,010 XPM·at block #6,840,832 · 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