Block #1,112,082

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/17/2015, 4:32:43 AM · Difficulty 10.8918 · 5,714,465 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
890587df24c07b13e0a7dd07823f43f30b5fd97e60f017d1b3fd0360f9ae6a8e

Height

#1,112,082

Difficulty

10.891766

Transactions

53

Size

18.12 KB

Version

2

Bits

0ae44ac2

Nonce

1,463,176,973

Timestamp

6/17/2015, 4:32:43 AM

Confirmations

5,714,465

Merkle Root

dc57d979a7036d9cf005601b83e5ee80cc026079ae039caebb43912f550b922a
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.

5.610 × 10⁹³(94-digit number)
56101806018828107160…49624020475364521759
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
5.610 × 10⁹³(94-digit number)
56101806018828107160…49624020475364521759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.122 × 10⁹⁴(95-digit number)
11220361203765621432…99248040950729043519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.244 × 10⁹⁴(95-digit number)
22440722407531242864…98496081901458087039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.488 × 10⁹⁴(95-digit number)
44881444815062485728…96992163802916174079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.976 × 10⁹⁴(95-digit number)
89762889630124971456…93984327605832348159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.795 × 10⁹⁵(96-digit number)
17952577926024994291…87968655211664696319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.590 × 10⁹⁵(96-digit number)
35905155852049988582…75937310423329392639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.181 × 10⁹⁵(96-digit number)
71810311704099977165…51874620846658785279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.436 × 10⁹⁶(97-digit number)
14362062340819995433…03749241693317570559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.872 × 10⁹⁶(97-digit number)
28724124681639990866…07498483386635141119
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,856,525 XPM·at block #6,826,546 · 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