Block #2,975,016

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/21/2018, 5:14:13 AM · Difficulty 11.3097 · 3,866,491 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0d22fcb83f82e3d4fd64805d50675f91cd3e0bf575b2edbac898db02b1420fdf

Height

#2,975,016

Difficulty

11.309677

Transactions

2

Size

721 B

Version

2

Bits

0b4f4700

Nonce

101,842,964

Timestamp

12/21/2018, 5:14:13 AM

Confirmations

3,866,491

Merkle Root

8130e5efa6267a84ede99b00796d60df4d55453be785872de95544dc567fb7d8
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.

1.406 × 10⁹⁵(96-digit number)
14066590033851799704…34613495413578023359
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.406 × 10⁹⁵(96-digit number)
14066590033851799704…34613495413578023359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.813 × 10⁹⁵(96-digit number)
28133180067703599409…69226990827156046719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.626 × 10⁹⁵(96-digit number)
56266360135407198819…38453981654312093439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.125 × 10⁹⁶(97-digit number)
11253272027081439763…76907963308624186879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.250 × 10⁹⁶(97-digit number)
22506544054162879527…53815926617248373759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.501 × 10⁹⁶(97-digit number)
45013088108325759055…07631853234496747519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.002 × 10⁹⁶(97-digit number)
90026176216651518111…15263706468993495039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.800 × 10⁹⁷(98-digit number)
18005235243330303622…30527412937986990079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.601 × 10⁹⁷(98-digit number)
36010470486660607244…61054825875973980159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.202 × 10⁹⁷(98-digit number)
72020940973321214489…22109651751947960319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.440 × 10⁹⁸(99-digit number)
14404188194664242897…44219303503895920639
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,976,435 XPM·at block #6,841,506 · 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