Block #2,604,941

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/8/2018, 3:35:24 AM · Difficulty 11.3000 · 4,236,841 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
72c88a379d99c24da8e51fe19ae730fc673ec9209d9e632b389195568a555056

Height

#2,604,941

Difficulty

11.300027

Transactions

3

Size

1.12 KB

Version

2

Bits

0b4cce90

Nonce

280,827,605

Timestamp

4/8/2018, 3:35:24 AM

Confirmations

4,236,841

Merkle Root

8e4db7914350c653471a2eb5c9000d6d1fd881917f9640cf98e86085fd6f5767
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.

6.401 × 10⁹⁵(96-digit number)
64014582108216894728…65190021971258703999
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
6.401 × 10⁹⁵(96-digit number)
64014582108216894728…65190021971258703999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.280 × 10⁹⁶(97-digit number)
12802916421643378945…30380043942517407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.560 × 10⁹⁶(97-digit number)
25605832843286757891…60760087885034815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.121 × 10⁹⁶(97-digit number)
51211665686573515782…21520175770069631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.024 × 10⁹⁷(98-digit number)
10242333137314703156…43040351540139263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.048 × 10⁹⁷(98-digit number)
20484666274629406313…86080703080278527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.096 × 10⁹⁷(98-digit number)
40969332549258812626…72161406160557055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.193 × 10⁹⁷(98-digit number)
81938665098517625252…44322812321114111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.638 × 10⁹⁸(99-digit number)
16387733019703525050…88645624642228223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.277 × 10⁹⁸(99-digit number)
32775466039407050100…77291249284456447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.555 × 10⁹⁸(99-digit number)
65550932078814100201…54582498568912895999
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,978,633 XPM·at block #6,841,781 · 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