Block #2,108,567

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/9/2017, 3:47:59 PM · Difficulty 10.8977 · 4,734,401 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e0b423ca39f57764044bc869913bd7298e5a9cf5453d442d9b54436a8cd260a7

Height

#2,108,567

Difficulty

10.897656

Transactions

2

Size

882 B

Version

2

Bits

0ae5ccc2

Nonce

1,318,805,118

Timestamp

5/9/2017, 3:47:59 PM

Confirmations

4,734,401

Merkle Root

811cc5f622394ec51f0bf047d1eed4f1f7b3ae2e6ccfef466eaa98703d97bc41
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.186 × 10⁹⁶(97-digit number)
11864865179363214296…00363536232784517119
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.186 × 10⁹⁶(97-digit number)
11864865179363214296…00363536232784517119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.372 × 10⁹⁶(97-digit number)
23729730358726428593…00727072465569034239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.745 × 10⁹⁶(97-digit number)
47459460717452857187…01454144931138068479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.491 × 10⁹⁶(97-digit number)
94918921434905714374…02908289862276136959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.898 × 10⁹⁷(98-digit number)
18983784286981142874…05816579724552273919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.796 × 10⁹⁷(98-digit number)
37967568573962285749…11633159449104547839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.593 × 10⁹⁷(98-digit number)
75935137147924571499…23266318898209095679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.518 × 10⁹⁸(99-digit number)
15187027429584914299…46532637796418191359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.037 × 10⁹⁸(99-digit number)
30374054859169828599…93065275592836382719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.074 × 10⁹⁸(99-digit number)
60748109718339657199…86130551185672765439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.214 × 10⁹⁹(100-digit number)
12149621943667931439…72261102371345530879
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,988,096 XPM·at block #6,842,967 · 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