Block #2,240,276

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/7/2017, 1:31:02 AM · Difficulty 10.9464 · 4,600,531 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5a6ff74d1605c232afbe7faef4a3e0b01c6ac79fe25bf7c57ad6b07bb3bc2cb3

Height

#2,240,276

Difficulty

10.946365

Transactions

9

Size

5.95 KB

Version

2

Bits

0af244f8

Nonce

189,661,016

Timestamp

8/7/2017, 1:31:02 AM

Confirmations

4,600,531

Merkle Root

f4a871ddc54a0eff6a8da74022f8f267b99e01265dd1a2f9b1abef75f4e43f8d
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.224 × 10⁹⁵(96-digit number)
12246191316542451668…10191627928686202079
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.224 × 10⁹⁵(96-digit number)
12246191316542451668…10191627928686202079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.449 × 10⁹⁵(96-digit number)
24492382633084903336…20383255857372404159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.898 × 10⁹⁵(96-digit number)
48984765266169806672…40766511714744808319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.796 × 10⁹⁵(96-digit number)
97969530532339613344…81533023429489616639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.959 × 10⁹⁶(97-digit number)
19593906106467922668…63066046858979233279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.918 × 10⁹⁶(97-digit number)
39187812212935845337…26132093717958466559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.837 × 10⁹⁶(97-digit number)
78375624425871690675…52264187435916933119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.567 × 10⁹⁷(98-digit number)
15675124885174338135…04528374871833866239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.135 × 10⁹⁷(98-digit number)
31350249770348676270…09056749743667732479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.270 × 10⁹⁷(98-digit number)
62700499540697352540…18113499487335464959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.254 × 10⁹⁸(99-digit number)
12540099908139470508…36226998974670929919
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,970,806 XPM·at block #6,840,806 · 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