Block #220,061

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 10/20/2013, 7:51:03 PM · Difficulty 9.9352 · 6,594,168 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ded288fe4ded35e7c1edd19e13680a41cebf89d87dd4a9f8e38a8839e7d68ce0

Height

#220,061

Difficulty

9.935227

Transactions

1

Size

1.24 KB

Version

2

Bits

09ef6b0a

Nonce

15,887

Timestamp

10/20/2013, 7:51:03 PM

Confirmations

6,594,168

Merkle Root

939f90c50deb6551541cdd4e2f3ad34a0c51ae270b233a73a29e6fcaeb55fce8
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.280 × 10⁹⁵(96-digit number)
22800050734081120509…86874810985699955399
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.280 × 10⁹⁵(96-digit number)
22800050734081120509…86874810985699955399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.560 × 10⁹⁵(96-digit number)
45600101468162241018…73749621971399910799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.120 × 10⁹⁵(96-digit number)
91200202936324482037…47499243942799821599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.824 × 10⁹⁶(97-digit number)
18240040587264896407…94998487885599643199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.648 × 10⁹⁶(97-digit number)
36480081174529792815…89996975771199286399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.296 × 10⁹⁶(97-digit number)
72960162349059585630…79993951542398572799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.459 × 10⁹⁷(98-digit number)
14592032469811917126…59987903084797145599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.918 × 10⁹⁷(98-digit number)
29184064939623834252…19975806169594291199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.836 × 10⁹⁷(98-digit number)
58368129879247668504…39951612339188582399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.167 × 10⁹⁸(99-digit number)
11673625975849533700…79903224678377164799
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,757,903 XPM·at block #6,814,228 · 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