Block #3,008,426

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/13/2019, 10:23:28 PM · Difficulty 11.2024 · 3,830,272 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5602c4039d7a8ef7f63692b2f5ec1ccad2d52b0f3540bc889d8c72e3a09b7c38

Height

#3,008,426

Difficulty

11.202377

Transactions

2

Size

1.72 KB

Version

2

Bits

0b33cefc

Nonce

107,729,016

Timestamp

1/13/2019, 10:23:28 PM

Confirmations

3,830,272

Merkle Root

d01f7eddb127a75f92416c147706824cc3b39642c762d1867b707e1ceb01d1af
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.

1.359 × 10⁹⁵(96-digit number)
13599630102750054197…46918705576865319039
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.359 × 10⁹⁵(96-digit number)
13599630102750054197…46918705576865319039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.719 × 10⁹⁵(96-digit number)
27199260205500108394…93837411153730638079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.439 × 10⁹⁵(96-digit number)
54398520411000216789…87674822307461276159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.087 × 10⁹⁶(97-digit number)
10879704082200043357…75349644614922552319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.175 × 10⁹⁶(97-digit number)
21759408164400086715…50699289229845104639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.351 × 10⁹⁶(97-digit number)
43518816328800173431…01398578459690209279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.703 × 10⁹⁶(97-digit number)
87037632657600346863…02797156919380418559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.740 × 10⁹⁷(98-digit number)
17407526531520069372…05594313838760837119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.481 × 10⁹⁷(98-digit number)
34815053063040138745…11188627677521674239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.963 × 10⁹⁷(98-digit number)
69630106126080277490…22377255355043348479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.392 × 10⁹⁸(99-digit number)
13926021225216055498…44754510710086696959
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,953,849 XPM·at block #6,838,697 · 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