Block #228,718

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/26/2013, 4:57:56 PM · Difficulty 9.9380 · 6,596,678 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
518d9300dccb7c6ca21e25fa05a2a3dfdf022369a3ace3b07dd730cee66e6d1c

Height

#228,718

Difficulty

9.937990

Transactions

3

Size

1.22 KB

Version

2

Bits

09f0201c

Nonce

88,014

Timestamp

10/26/2013, 4:57:56 PM

Confirmations

6,596,678

Merkle Root

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

4.367 × 10⁹⁸(99-digit number)
43671484209780248976…58759370319678845999
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
4.367 × 10⁹⁸(99-digit number)
43671484209780248976…58759370319678845999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.734 × 10⁹⁸(99-digit number)
87342968419560497953…17518740639357691999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.746 × 10⁹⁹(100-digit number)
17468593683912099590…35037481278715383999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.493 × 10⁹⁹(100-digit number)
34937187367824199181…70074962557430767999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.987 × 10⁹⁹(100-digit number)
69874374735648398362…40149925114861535999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.397 × 10¹⁰⁰(101-digit number)
13974874947129679672…80299850229723071999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.794 × 10¹⁰⁰(101-digit number)
27949749894259359345…60599700459446143999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.589 × 10¹⁰⁰(101-digit number)
55899499788518718690…21199400918892287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.117 × 10¹⁰¹(102-digit number)
11179899957703743738…42398801837784575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.235 × 10¹⁰¹(102-digit number)
22359799915407487476…84797603675569151999
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,847,268 XPM·at block #6,825,395 · 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