Block #2,927,966

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/18/2018, 5:02:34 AM · Difficulty 11.3707 · 3,903,913 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d00c2d78e2a344fc6f9a34b4cf37a21cc6b5d30b35e867a842639ec424745b25

Height

#2,927,966

Difficulty

11.370713

Transactions

2

Size

2.10 KB

Version

2

Bits

0b5ee707

Nonce

400,157,949

Timestamp

11/18/2018, 5:02:34 AM

Confirmations

3,903,913

Merkle Root

2efb1778bd306024fc61bb8806d2732a045acd8a5c6e9c66d4a39bb631a7e19f
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.387 × 10⁹³(94-digit number)
13871876213571990889…89013163673768145279
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.387 × 10⁹³(94-digit number)
13871876213571990889…89013163673768145279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.774 × 10⁹³(94-digit number)
27743752427143981779…78026327347536290559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.548 × 10⁹³(94-digit number)
55487504854287963558…56052654695072581119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.109 × 10⁹⁴(95-digit number)
11097500970857592711…12105309390145162239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.219 × 10⁹⁴(95-digit number)
22195001941715185423…24210618780290324479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.439 × 10⁹⁴(95-digit number)
44390003883430370846…48421237560580648959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.878 × 10⁹⁴(95-digit number)
88780007766860741693…96842475121161297919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.775 × 10⁹⁵(96-digit number)
17756001553372148338…93684950242322595839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.551 × 10⁹⁵(96-digit number)
35512003106744296677…87369900484645191679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.102 × 10⁹⁵(96-digit number)
71024006213488593354…74739800969290383359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.420 × 10⁹⁶(97-digit number)
14204801242697718670…49479601938580766719
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,899,154 XPM·at block #6,831,878 · 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