Block #2,634,062

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 6:04:06 PM · Difficulty 11.2208 · 4,209,590 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
36262147cc5f32e65215ef225d62565cc46fa456faa2a2c63816646cb4a8e31d

Height

#2,634,062

Difficulty

11.220814

Transactions

3

Size

1.28 KB

Version

2

Bits

0b388741

Nonce

45,241,332

Timestamp

4/28/2018, 6:04:06 PM

Confirmations

4,209,590

Merkle Root

9d60614cc61f51cfe5bb88a8320e78e65b238b5636d19eff42f376e4ddd7c718
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.966 × 10⁹⁶(97-digit number)
19662000394409846962…37211278531931617279
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.966 × 10⁹⁶(97-digit number)
19662000394409846962…37211278531931617279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.932 × 10⁹⁶(97-digit number)
39324000788819693925…74422557063863234559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.864 × 10⁹⁶(97-digit number)
78648001577639387851…48845114127726469119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.572 × 10⁹⁷(98-digit number)
15729600315527877570…97690228255452938239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.145 × 10⁹⁷(98-digit number)
31459200631055755140…95380456510905876479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.291 × 10⁹⁷(98-digit number)
62918401262111510280…90760913021811752959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.258 × 10⁹⁸(99-digit number)
12583680252422302056…81521826043623505919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.516 × 10⁹⁸(99-digit number)
25167360504844604112…63043652087247011839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.033 × 10⁹⁸(99-digit number)
50334721009689208224…26087304174494023679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.006 × 10⁹⁹(100-digit number)
10066944201937841644…52174608348988047359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.013 × 10⁹⁹(100-digit number)
20133888403875683289…04349216697976094719
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,993,587 XPM·at block #6,843,651 · 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