Block #2,648,281

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/4/2018, 10:07:26 AM · Difficulty 11.7659 · 4,185,718 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0468cd60a9fe1ca156a11d0cf72c10046445aa43e3205f93eebc9ef6a656cf9b

Height

#2,648,281

Difficulty

11.765924

Transactions

2

Size

542 B

Version

2

Bits

0bc4139f

Nonce

829,928,831

Timestamp

5/4/2018, 10:07:26 AM

Confirmations

4,185,718

Merkle Root

1ce3c97f0da94e280f80f4735644f6a9a6ab8403c36ff8ee053bbfa7f7205b15
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.196 × 10⁹⁷(98-digit number)
11961377994867178929…62371904323581332479
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.196 × 10⁹⁷(98-digit number)
11961377994867178929…62371904323581332479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.392 × 10⁹⁷(98-digit number)
23922755989734357859…24743808647162664959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.784 × 10⁹⁷(98-digit number)
47845511979468715719…49487617294325329919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.569 × 10⁹⁷(98-digit number)
95691023958937431438…98975234588650659839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.913 × 10⁹⁸(99-digit number)
19138204791787486287…97950469177301319679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.827 × 10⁹⁸(99-digit number)
38276409583574972575…95900938354602639359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.655 × 10⁹⁸(99-digit number)
76552819167149945150…91801876709205278719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.531 × 10⁹⁹(100-digit number)
15310563833429989030…83603753418410557439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.062 × 10⁹⁹(100-digit number)
30621127666859978060…67207506836821114879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.124 × 10⁹⁹(100-digit number)
61242255333719956120…34415013673642229759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.224 × 10¹⁰⁰(101-digit number)
12248451066743991224…68830027347284459519
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,916,219 XPM·at block #6,833,998 · 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