Block #1,665,779

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/9/2016, 12:27:36 PM · Difficulty 10.7121 · 5,159,897 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b80798b435dd578695ca52fa6baaad224328be73ce0f7b65e33c3241539d07d2

Height

#1,665,779

Difficulty

10.712072

Transactions

3

Size

3.89 KB

Version

2

Bits

0ab64a61

Nonce

472,785,610

Timestamp

7/9/2016, 12:27:36 PM

Confirmations

5,159,897

Merkle Root

e8b874321e3b7faae40ca92b01fe25062232a9f50db7fd52e08e41f2ee445f6b
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.

1.230 × 10⁹⁶(97-digit number)
12304769712371701957…54071410769722060799
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
1.230 × 10⁹⁶(97-digit number)
12304769712371701957…54071410769722060799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.460 × 10⁹⁶(97-digit number)
24609539424743403914…08142821539444121599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.921 × 10⁹⁶(97-digit number)
49219078849486807829…16285643078888243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.843 × 10⁹⁶(97-digit number)
98438157698973615658…32571286157776486399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.968 × 10⁹⁷(98-digit number)
19687631539794723131…65142572315552972799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.937 × 10⁹⁷(98-digit number)
39375263079589446263…30285144631105945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.875 × 10⁹⁷(98-digit number)
78750526159178892527…60570289262211891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.575 × 10⁹⁸(99-digit number)
15750105231835778505…21140578524423782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.150 × 10⁹⁸(99-digit number)
31500210463671557010…42281157048847564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.300 × 10⁹⁸(99-digit number)
63000420927343114021…84562314097695129599
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,849,517 XPM·at block #6,825,675 · 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