Block #1,903,806

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/20/2016, 11:01:36 PM · Difficulty 10.7819 · 4,904,004 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
71ebc401cb53e04c2f2796d6b210541bf795cef56df1b8cd10dbf06895475bf2

Height

#1,903,806

Difficulty

10.781943

Transactions

2

Size

869 B

Version

2

Bits

0ac82d65

Nonce

668,349,568

Timestamp

12/20/2016, 11:01:36 PM

Confirmations

4,904,004

Merkle Root

51718b8b8518d13af87ec754683f79873068d55025439f415e3d5adb2007fde5
Transactions (2)
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.318 × 10⁹³(94-digit number)
23181205760332928650…16676954924221905339
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.318 × 10⁹³(94-digit number)
23181205760332928650…16676954924221905339
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.636 × 10⁹³(94-digit number)
46362411520665857300…33353909848443810679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.272 × 10⁹³(94-digit number)
92724823041331714600…66707819696887621359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.854 × 10⁹⁴(95-digit number)
18544964608266342920…33415639393775242719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.708 × 10⁹⁴(95-digit number)
37089929216532685840…66831278787550485439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.417 × 10⁹⁴(95-digit number)
74179858433065371680…33662557575100970879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.483 × 10⁹⁵(96-digit number)
14835971686613074336…67325115150201941759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.967 × 10⁹⁵(96-digit number)
29671943373226148672…34650230300403883519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.934 × 10⁹⁵(96-digit number)
59343886746452297344…69300460600807767039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.186 × 10⁹⁶(97-digit number)
11868777349290459468…38600921201615534079
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,706,515 XPM·at block #6,807,809 · 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.

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