Block #3,011,771

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/16/2019, 8:47:35 AM · Difficulty 11.1767 · 3,805,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
5197d31054da88e6af6cad6e9b60c5a8cd73889de6b8cc8f3fda0b0c571c8c30

Height

#3,011,771

Difficulty

11.176735

Transactions

4

Size

1.30 KB

Version

2

Bits

0b2d3e85

Nonce

154,371,030

Timestamp

1/16/2019, 8:47:35 AM

Confirmations

3,805,713

Merkle Root

fc607669353491a15d24c42ba9181c6a51097e47ca1a1bd7aeac08be7a20e448
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.020 × 10⁹⁴(95-digit number)
60205518266652457430…52728209475134776479
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.020 × 10⁹⁴(95-digit number)
60205518266652457430…52728209475134776479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.204 × 10⁹⁵(96-digit number)
12041103653330491486…05456418950269552959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.408 × 10⁹⁵(96-digit number)
24082207306660982972…10912837900539105919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.816 × 10⁹⁵(96-digit number)
48164414613321965944…21825675801078211839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.632 × 10⁹⁵(96-digit number)
96328829226643931888…43651351602156423679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.926 × 10⁹⁶(97-digit number)
19265765845328786377…87302703204312847359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.853 × 10⁹⁶(97-digit number)
38531531690657572755…74605406408625694719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.706 × 10⁹⁶(97-digit number)
77063063381315145511…49210812817251389439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.541 × 10⁹⁷(98-digit number)
15412612676263029102…98421625634502778879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.082 × 10⁹⁷(98-digit number)
30825225352526058204…96843251269005557759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.165 × 10⁹⁷(98-digit number)
61650450705052116408…93686502538011115519
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,783,926 XPM·at block #6,817,483 · 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