Block #2,297,111

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/15/2017, 12:37:38 PM · Difficulty 10.9484 · 4,545,807 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
01e73ff09abc92f82d7c9e2b44e0bd5e7f0d5219d3bb1df3fa655f83cf6261b6

Height

#2,297,111

Difficulty

10.948365

Transactions

3

Size

652 B

Version

2

Bits

0af2c812

Nonce

219,518,241

Timestamp

9/15/2017, 12:37:38 PM

Confirmations

4,545,807

Merkle Root

30d8bb8bd785ff2fc010db139823a21e2db7be8ed8dd79f7f7df86d7f3a9e3dd
Transactions (3)
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.

7.866 × 10⁹³(94-digit number)
78667289079070875081…71331841822303228079
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
7.866 × 10⁹³(94-digit number)
78667289079070875081…71331841822303228079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.573 × 10⁹⁴(95-digit number)
15733457815814175016…42663683644606456159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.146 × 10⁹⁴(95-digit number)
31466915631628350032…85327367289212912319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.293 × 10⁹⁴(95-digit number)
62933831263256700064…70654734578425824639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.258 × 10⁹⁵(96-digit number)
12586766252651340012…41309469156851649279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.517 × 10⁹⁵(96-digit number)
25173532505302680025…82618938313703298559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.034 × 10⁹⁵(96-digit number)
50347065010605360051…65237876627406597119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.006 × 10⁹⁶(97-digit number)
10069413002121072010…30475753254813194239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.013 × 10⁹⁶(97-digit number)
20138826004242144020…60951506509626388479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.027 × 10⁹⁶(97-digit number)
40277652008484288041…21903013019252776959
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,987,691 XPM·at block #6,842,917 · 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