Block #224,742

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/24/2013, 12:02:16 AM · Difficulty 9.9368 · 6,589,281 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ec0cd481db6467e7cd60dfa0f0f87266b460920d2cd6e6e667dec3b19a6f6b36

Height

#224,742

Difficulty

9.936836

Transactions

3

Size

1.32 KB

Version

2

Bits

09efd484

Nonce

27,461

Timestamp

10/24/2013, 12:02:16 AM

Confirmations

6,589,281

Merkle Root

50f0ba95b7232d17e5506496617010142d56cff5044ae31ec649393e207474da
Transactions (3)
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.288 × 10⁹⁷(98-digit number)
22884015400306835369…48372463593233817599
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.288 × 10⁹⁷(98-digit number)
22884015400306835369…48372463593233817599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.576 × 10⁹⁷(98-digit number)
45768030800613670739…96744927186467635199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.153 × 10⁹⁷(98-digit number)
91536061601227341479…93489854372935270399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.830 × 10⁹⁸(99-digit number)
18307212320245468295…86979708745870540799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.661 × 10⁹⁸(99-digit number)
36614424640490936591…73959417491741081599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.322 × 10⁹⁸(99-digit number)
73228849280981873183…47918834983482163199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.464 × 10⁹⁹(100-digit number)
14645769856196374636…95837669966964326399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.929 × 10⁹⁹(100-digit number)
29291539712392749273…91675339933928652799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.858 × 10⁹⁹(100-digit number)
58583079424785498547…83350679867857305599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.171 × 10¹⁰⁰(101-digit number)
11716615884957099709…66701359735714611199
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,756,265 XPM·at block #6,814,022 · 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