Block #3,016,853

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/19/2019, 10:18:26 PM · Difficulty 11.1691 · 3,799,457 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
66ee96adf9da75262a547565b6373a95e0f615a9888c4f84bef1338be2f7356c

Height

#3,016,853

Difficulty

11.169100

Transactions

7

Size

2.30 KB

Version

2

Bits

0b2b4a1c

Nonce

353,264,259

Timestamp

1/19/2019, 10:18:26 PM

Confirmations

3,799,457

Merkle Root

36c14ea65386be0530c7e08f25c123a5bf9447353bb38943de97c8ddc5834bce
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.

8.540 × 10⁹⁴(95-digit number)
85401543396701897103…31477007591910697599
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
8.540 × 10⁹⁴(95-digit number)
85401543396701897103…31477007591910697599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.708 × 10⁹⁵(96-digit number)
17080308679340379420…62954015183821395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.416 × 10⁹⁵(96-digit number)
34160617358680758841…25908030367642790399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.832 × 10⁹⁵(96-digit number)
68321234717361517682…51816060735285580799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.366 × 10⁹⁶(97-digit number)
13664246943472303536…03632121470571161599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.732 × 10⁹⁶(97-digit number)
27328493886944607073…07264242941142323199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.465 × 10⁹⁶(97-digit number)
54656987773889214146…14528485882284646399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.093 × 10⁹⁷(98-digit number)
10931397554777842829…29056971764569292799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.186 × 10⁹⁷(98-digit number)
21862795109555685658…58113943529138585599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.372 × 10⁹⁷(98-digit number)
43725590219111371316…16227887058277171199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.745 × 10⁹⁷(98-digit number)
87451180438222742633…32455774116554342399
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,774,601 XPM·at block #6,816,309 · 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