Block #2,854,624

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/25/2018, 1:41:56 PM · Difficulty 11.7077 · 3,985,639 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2d336808f083e10171bcde5d92f67626d3c516269f58e654cfefbb1492793931

Height

#2,854,624

Difficulty

11.707692

Transactions

10

Size

5.88 KB

Version

2

Bits

0bb52b50

Nonce

1,343,405,578

Timestamp

9/25/2018, 1:41:56 PM

Confirmations

3,985,639

Merkle Root

e7ec10f708c3557445f9b3a903c57ea6763aac4084741a67df5e6994005bc38a
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.817 × 10⁹⁵(96-digit number)
28177036530551246536…62111045424684933119
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.817 × 10⁹⁵(96-digit number)
28177036530551246536…62111045424684933119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.635 × 10⁹⁵(96-digit number)
56354073061102493073…24222090849369866239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.127 × 10⁹⁶(97-digit number)
11270814612220498614…48444181698739732479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.254 × 10⁹⁶(97-digit number)
22541629224440997229…96888363397479464959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.508 × 10⁹⁶(97-digit number)
45083258448881994458…93776726794958929919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.016 × 10⁹⁶(97-digit number)
90166516897763988917…87553453589917859839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.803 × 10⁹⁷(98-digit number)
18033303379552797783…75106907179835719679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.606 × 10⁹⁷(98-digit number)
36066606759105595567…50213814359671439359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.213 × 10⁹⁷(98-digit number)
72133213518211191134…00427628719342878719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.442 × 10⁹⁸(99-digit number)
14426642703642238226…00855257438685757439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.885 × 10⁹⁸(99-digit number)
28853285407284476453…01710514877371514879
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,966,418 XPM·at block #6,840,262 · 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