Block #1,125,875

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/25/2015, 6:16:18 AM · Difficulty 10.9301 · 5,699,841 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f8c77716a8ef62c007a90d699e2931cd314a6f83f6bf756c21956add9475067a

Height

#1,125,875

Difficulty

10.930064

Transactions

2

Size

5.04 KB

Version

2

Bits

0aee18a5

Nonce

1,118,718,944

Timestamp

6/25/2015, 6:16:18 AM

Confirmations

5,699,841

Merkle Root

088f69719e44a1b04a7b30e0f254230c086b78fd0d38432710ac19b55e7fa16d
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.

5.635 × 10⁹³(94-digit number)
56354981368919161907…79277555939912876589
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.635 × 10⁹³(94-digit number)
56354981368919161907…79277555939912876589
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.127 × 10⁹⁴(95-digit number)
11270996273783832381…58555111879825753179
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.254 × 10⁹⁴(95-digit number)
22541992547567664762…17110223759651506359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.508 × 10⁹⁴(95-digit number)
45083985095135329525…34220447519303012719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.016 × 10⁹⁴(95-digit number)
90167970190270659051…68440895038606025439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.803 × 10⁹⁵(96-digit number)
18033594038054131810…36881790077212050879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.606 × 10⁹⁵(96-digit number)
36067188076108263620…73763580154424101759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.213 × 10⁹⁵(96-digit number)
72134376152216527241…47527160308848203519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.442 × 10⁹⁶(97-digit number)
14426875230443305448…95054320617696407039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.885 × 10⁹⁶(97-digit number)
28853750460886610896…90108641235392814079
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,849,833 XPM·at block #6,825,715 · 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