Block #2,964,489

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2018, 4:26:23 PM · Difficulty 11.3518 · 3,875,202 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6e70c0c86d9722e24b11861ce4900ab5f6314c61593c1d77757da5bde125b2f0

Height

#2,964,489

Difficulty

11.351779

Transactions

4

Size

1.40 KB

Version

2

Bits

0b5a0e2c

Nonce

1,301,260,156

Timestamp

12/13/2018, 4:26:23 PM

Confirmations

3,875,202

Merkle Root

b4c70085464740e7503296919f7cc3bbba9e036e1af8e5cb738174b9e01a87ec
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.151 × 10⁹²(93-digit number)
21518136151974435677…40575340617414649599
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.151 × 10⁹²(93-digit number)
21518136151974435677…40575340617414649599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.303 × 10⁹²(93-digit number)
43036272303948871355…81150681234829299199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.607 × 10⁹²(93-digit number)
86072544607897742710…62301362469658598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.721 × 10⁹³(94-digit number)
17214508921579548542…24602724939317196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.442 × 10⁹³(94-digit number)
34429017843159097084…49205449878634393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.885 × 10⁹³(94-digit number)
68858035686318194168…98410899757268787199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.377 × 10⁹⁴(95-digit number)
13771607137263638833…96821799514537574399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.754 × 10⁹⁴(95-digit number)
27543214274527277667…93643599029075148799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.508 × 10⁹⁴(95-digit number)
55086428549054555334…87287198058150297599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.101 × 10⁹⁵(96-digit number)
11017285709810911066…74574396116300595199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.203 × 10⁹⁵(96-digit number)
22034571419621822133…49148792232601190399
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,816 XPM·at block #6,839,690 · 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