Block #2,910,684

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/5/2018, 4:01:10 AM · Difficulty 11.5323 · 3,923,276 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5efdad7fa24a991554b5f7c3114dd5be0e8b4c98cc73f14d748929898038921a

Height

#2,910,684

Difficulty

11.532314

Transactions

6

Size

2.18 KB

Version

2

Bits

0b8845bd

Nonce

405,147,084

Timestamp

11/5/2018, 4:01:10 AM

Confirmations

3,923,276

Merkle Root

95b9f26c85d28f14528abc998081e8ab9d2149cd83eb0ba9e0b178b219b9308b
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.

9.932 × 10⁹⁷(98-digit number)
99325101362151962974…10822809890018877439
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
9.932 × 10⁹⁷(98-digit number)
99325101362151962974…10822809890018877439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.986 × 10⁹⁸(99-digit number)
19865020272430392594…21645619780037754879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.973 × 10⁹⁸(99-digit number)
39730040544860785189…43291239560075509759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.946 × 10⁹⁸(99-digit number)
79460081089721570379…86582479120151019519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.589 × 10⁹⁹(100-digit number)
15892016217944314075…73164958240302039039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.178 × 10⁹⁹(100-digit number)
31784032435888628151…46329916480604078079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.356 × 10⁹⁹(100-digit number)
63568064871777256303…92659832961208156159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.271 × 10¹⁰⁰(101-digit number)
12713612974355451260…85319665922416312319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.542 × 10¹⁰⁰(101-digit number)
25427225948710902521…70639331844832624639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.085 × 10¹⁰⁰(101-digit number)
50854451897421805043…41278663689665249279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.017 × 10¹⁰¹(102-digit number)
10170890379484361008…82557327379330498559
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,915,908 XPM·at block #6,833,959 · 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