Block #1,112,262

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/17/2015, 5:52:56 AM · Difficulty 10.8939 · 5,695,915 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7e21263305dae727bc3ef40d8332fc4ad954caca27392cc38153a36c1f618bea

Height

#1,112,262

Difficulty

10.893908

Transactions

4

Size

1.00 KB

Version

2

Bits

0ae4d72d

Nonce

738,749,934

Timestamp

6/17/2015, 5:52:56 AM

Confirmations

5,695,915

Merkle Root

713f9da92681e403c30f31c8e747a8b9fcef84212f61ad91e2b9de6251f96128
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.972 × 10⁹⁷(98-digit number)
19727641427801159103…94983016395311718399
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.972 × 10⁹⁷(98-digit number)
19727641427801159103…94983016395311718399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.945 × 10⁹⁷(98-digit number)
39455282855602318207…89966032790623436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.891 × 10⁹⁷(98-digit number)
78910565711204636414…79932065581246873599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.578 × 10⁹⁸(99-digit number)
15782113142240927282…59864131162493747199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.156 × 10⁹⁸(99-digit number)
31564226284481854565…19728262324987494399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.312 × 10⁹⁸(99-digit number)
63128452568963709131…39456524649974988799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.262 × 10⁹⁹(100-digit number)
12625690513792741826…78913049299949977599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.525 × 10⁹⁹(100-digit number)
25251381027585483652…57826098599899955199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.050 × 10⁹⁹(100-digit number)
50502762055170967305…15652197199799910399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.010 × 10¹⁰⁰(101-digit number)
10100552411034193461…31304394399599820799
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,709,464 XPM·at block #6,808,176 · 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.

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