Block #304,665

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/11/2013, 1:23:07 AM · Difficulty 9.9934 · 6,505,812 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1f17516da13f61dacb35c42a92bdf0bbe93cb75750e97274f95427742746c015

Height

#304,665

Difficulty

9.993403

Transactions

7

Size

15.24 KB

Version

2

Bits

09fe4fa1

Nonce

174,331

Timestamp

12/11/2013, 1:23:07 AM

Confirmations

6,505,812

Merkle Root

f8e0ee1f87511698070a5ed838284922c39b740fe8f9775c36a3f8460972b471
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.721 × 10⁹⁷(98-digit number)
27215795031617592532…14530282239880494081
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.721 × 10⁹⁷(98-digit number)
27215795031617592532…14530282239880494081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.443 × 10⁹⁷(98-digit number)
54431590063235185065…29060564479760988161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.088 × 10⁹⁸(99-digit number)
10886318012647037013…58121128959521976321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.177 × 10⁹⁸(99-digit number)
21772636025294074026…16242257919043952641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.354 × 10⁹⁸(99-digit number)
43545272050588148052…32484515838087905281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.709 × 10⁹⁸(99-digit number)
87090544101176296104…64969031676175810561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.741 × 10⁹⁹(100-digit number)
17418108820235259220…29938063352351621121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.483 × 10⁹⁹(100-digit number)
34836217640470518441…59876126704703242241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.967 × 10⁹⁹(100-digit number)
69672435280941036883…19752253409406484481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.393 × 10¹⁰⁰(101-digit number)
13934487056188207376…39504506818812968961
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,727,895 XPM·at block #6,810,476 · 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