Block #1,730,898

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/23/2016, 5:28:43 PM · Difficulty 10.7154 · 5,096,212 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c0f90b57518300e03a3d7a1a8626ef9fabfc5851a0df18b3b98af8ed095953ad

Height

#1,730,898

Difficulty

10.715368

Transactions

2

Size

426 B

Version

2

Bits

0ab72254

Nonce

1,401,102,680

Timestamp

8/23/2016, 5:28:43 PM

Confirmations

5,096,212

Merkle Root

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

1.384 × 10⁹⁷(98-digit number)
13846787879651072767…47855459253904220159
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.384 × 10⁹⁷(98-digit number)
13846787879651072767…47855459253904220159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.769 × 10⁹⁷(98-digit number)
27693575759302145535…95710918507808440319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.538 × 10⁹⁷(98-digit number)
55387151518604291070…91421837015616880639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.107 × 10⁹⁸(99-digit number)
11077430303720858214…82843674031233761279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.215 × 10⁹⁸(99-digit number)
22154860607441716428…65687348062467522559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.430 × 10⁹⁸(99-digit number)
44309721214883432856…31374696124935045119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.861 × 10⁹⁸(99-digit number)
88619442429766865712…62749392249870090239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.772 × 10⁹⁹(100-digit number)
17723888485953373142…25498784499740180479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.544 × 10⁹⁹(100-digit number)
35447776971906746285…50997568999480360959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.089 × 10⁹⁹(100-digit number)
70895553943813492570…01995137998960721919
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,861,059 XPM·at block #6,827,109 · 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