Block #2,664,144

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/16/2018, 8:00:13 PM · Difficulty 11.6519 · 4,169,858 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c4ccd18a82a1212970780c1972d2cedbed8b70d334c81824fd0b1968dfd12e36

Height

#2,664,144

Difficulty

11.651941

Transactions

44

Size

15.07 KB

Version

2

Bits

0ba6e59c

Nonce

647,351,137

Timestamp

5/16/2018, 8:00:13 PM

Confirmations

4,169,858

Merkle Root

5a08b496dea174137a2f2055b853c6a96b3d6fd0e741a57f3ce0fdbecabf908f
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.014 × 10⁹⁴(95-digit number)
90144879754616954832…94336200275805102079
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.014 × 10⁹⁴(95-digit number)
90144879754616954832…94336200275805102079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.802 × 10⁹⁵(96-digit number)
18028975950923390966…88672400551610204159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.605 × 10⁹⁵(96-digit number)
36057951901846781932…77344801103220408319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.211 × 10⁹⁵(96-digit number)
72115903803693563865…54689602206440816639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.442 × 10⁹⁶(97-digit number)
14423180760738712773…09379204412881633279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.884 × 10⁹⁶(97-digit number)
28846361521477425546…18758408825763266559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.769 × 10⁹⁶(97-digit number)
57692723042954851092…37516817651526533119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.153 × 10⁹⁷(98-digit number)
11538544608590970218…75033635303053066239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.307 × 10⁹⁷(98-digit number)
23077089217181940437…50067270606106132479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.615 × 10⁹⁷(98-digit number)
46154178434363880874…00134541212212264959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.230 × 10⁹⁷(98-digit number)
92308356868727761748…00269082424424529919
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,916,243 XPM·at block #6,834,001 · 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