Block #2,694,383

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/6/2018, 1:54:27 PM · Difficulty 11.6774 · 4,148,406 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
67fb945a80b3bad1a2ec04b5c264350c7911a8505191f8ac22a63263d69ec6e0

Height

#2,694,383

Difficulty

11.677355

Transactions

2

Size

869 B

Version

2

Bits

0bad6729

Nonce

200,082,470

Timestamp

6/6/2018, 1:54:27 PM

Confirmations

4,148,406

Merkle Root

19ea40aae72ace096e23dcc639fef4fb139e5daba9edbca99ffa5238dd54ea40
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.

9.638 × 10⁹²(93-digit number)
96381434841829160659…99968952901161361599
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
9.638 × 10⁹²(93-digit number)
96381434841829160659…99968952901161361599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.927 × 10⁹³(94-digit number)
19276286968365832131…99937905802322723199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.855 × 10⁹³(94-digit number)
38552573936731664263…99875811604645446399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.710 × 10⁹³(94-digit number)
77105147873463328527…99751623209290892799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.542 × 10⁹⁴(95-digit number)
15421029574692665705…99503246418581785599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.084 × 10⁹⁴(95-digit number)
30842059149385331410…99006492837163571199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.168 × 10⁹⁴(95-digit number)
61684118298770662821…98012985674327142399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.233 × 10⁹⁵(96-digit number)
12336823659754132564…96025971348654284799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.467 × 10⁹⁵(96-digit number)
24673647319508265128…92051942697308569599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.934 × 10⁹⁵(96-digit number)
49347294639016530257…84103885394617139199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.869 × 10⁹⁵(96-digit number)
98694589278033060515…68207770789234278399
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,986,650 XPM·at block #6,842,788 · 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