Block #718,230

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/13/2014, 2:25:19 AM · Difficulty 10.9497 · 6,097,718 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1afb294d6b52366942179dc9b636db4efd18f532c38291d60943c037a4aed132

Height

#718,230

Difficulty

10.949707

Transactions

2

Size

580 B

Version

2

Bits

0af32006

Nonce

348,673,479

Timestamp

9/13/2014, 2:25:19 AM

Confirmations

6,097,718

Merkle Root

5e85f32ea33a78f04c2f212b3e5c92d7fc346d4a9c0a55a034ce15a67ada2798
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.

2.817 × 10⁹⁷(98-digit number)
28173889043704259427…53448924939041517559
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
2.817 × 10⁹⁷(98-digit number)
28173889043704259427…53448924939041517559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.634 × 10⁹⁷(98-digit number)
56347778087408518855…06897849878083035119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.126 × 10⁹⁸(99-digit number)
11269555617481703771…13795699756166070239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.253 × 10⁹⁸(99-digit number)
22539111234963407542…27591399512332140479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.507 × 10⁹⁸(99-digit number)
45078222469926815084…55182799024664280959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.015 × 10⁹⁸(99-digit number)
90156444939853630169…10365598049328561919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.803 × 10⁹⁹(100-digit number)
18031288987970726033…20731196098657123839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.606 × 10⁹⁹(100-digit number)
36062577975941452067…41462392197314247679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.212 × 10⁹⁹(100-digit number)
72125155951882904135…82924784394628495359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.442 × 10¹⁰⁰(101-digit number)
14425031190376580827…65849568789256990719
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,771,698 XPM·at block #6,815,947 · 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