Block #2,954,688

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/6/2018, 2:15:43 PM · Difficulty 11.4021 · 3,884,924 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6ce44d30033e47662f8bf176dfcfbaab62c9ae259d44e44f7595c0fd32be5379

Height

#2,954,688

Difficulty

11.402072

Transactions

11

Size

6.90 KB

Version

2

Bits

0b66ee2e

Nonce

1,804,871,815

Timestamp

12/6/2018, 2:15:43 PM

Confirmations

3,884,924

Merkle Root

a8d3063e651269c38633c3bfff1f89c31b7fc914871c68f69641b0b016aefddc
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.322 × 10⁹³(94-digit number)
23223139538275228599…64242347855246765199
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.322 × 10⁹³(94-digit number)
23223139538275228599…64242347855246765199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.644 × 10⁹³(94-digit number)
46446279076550457198…28484695710493530399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.289 × 10⁹³(94-digit number)
92892558153100914396…56969391420987060799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.857 × 10⁹⁴(95-digit number)
18578511630620182879…13938782841974121599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.715 × 10⁹⁴(95-digit number)
37157023261240365758…27877565683948243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.431 × 10⁹⁴(95-digit number)
74314046522480731516…55755131367896486399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.486 × 10⁹⁵(96-digit number)
14862809304496146303…11510262735792972799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.972 × 10⁹⁵(96-digit number)
29725618608992292606…23020525471585945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.945 × 10⁹⁵(96-digit number)
59451237217984585213…46041050943171891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.189 × 10⁹⁶(97-digit number)
11890247443596917042…92082101886343782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.378 × 10⁹⁶(97-digit number)
23780494887193834085…84164203772687564799
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,961,186 XPM·at block #6,839,611 · 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