Block #2,809,039

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/25/2018, 8:30:35 AM · Difficulty 11.6668 · 4,034,713 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5ca1303f2a00153ab784dc0b7cfbda5cb70c936c18315af08e5b47f14624c6e9

Height

#2,809,039

Difficulty

11.666845

Transactions

3

Size

2.23 KB

Version

2

Bits

0baab65b

Nonce

107,802,523

Timestamp

8/25/2018, 8:30:35 AM

Confirmations

4,034,713

Merkle Root

a76035263e569e33a756bd7b664935685e00c33a5b08c8772e7f06209b561ab0
Transactions (3)
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.

5.226 × 10⁹³(94-digit number)
52265794643964865111…71299433752777989599
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
5.226 × 10⁹³(94-digit number)
52265794643964865111…71299433752777989599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.045 × 10⁹⁴(95-digit number)
10453158928792973022…42598867505555979199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.090 × 10⁹⁴(95-digit number)
20906317857585946044…85197735011111958399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.181 × 10⁹⁴(95-digit number)
41812635715171892089…70395470022223916799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.362 × 10⁹⁴(95-digit number)
83625271430343784179…40790940044447833599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.672 × 10⁹⁵(96-digit number)
16725054286068756835…81581880088895667199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.345 × 10⁹⁵(96-digit number)
33450108572137513671…63163760177791334399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.690 × 10⁹⁵(96-digit number)
66900217144275027343…26327520355582668799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.338 × 10⁹⁶(97-digit number)
13380043428855005468…52655040711165337599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.676 × 10⁹⁶(97-digit number)
26760086857710010937…05310081422330675199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.352 × 10⁹⁶(97-digit number)
53520173715420021874…10620162844661350399
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,994,387 XPM·at block #6,843,751 · 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