Block #445,633

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/16/2014, 12:56:04 AM · Difficulty 10.3563 · 6,364,322 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
db8697725e9107fd8814469cc1ceddecaf8c58d15260ffda1d5aae48a016d524

Height

#445,633

Difficulty

10.356296

Transactions

4

Size

5.36 KB

Version

2

Bits

0a5b3635

Nonce

8,457

Timestamp

3/16/2014, 12:56:04 AM

Confirmations

6,364,322

Merkle Root

34a10a9fad5a7c2cd28c45c1248dc48ccdb1d328909a2512a64fa27d82098afe
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.

5.393 × 10⁹⁹(100-digit number)
53933723674802501562…34357009614278287359
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
5.393 × 10⁹⁹(100-digit number)
53933723674802501562…34357009614278287359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.078 × 10¹⁰⁰(101-digit number)
10786744734960500312…68714019228556574719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.157 × 10¹⁰⁰(101-digit number)
21573489469921000624…37428038457113149439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.314 × 10¹⁰⁰(101-digit number)
43146978939842001249…74856076914226298879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.629 × 10¹⁰⁰(101-digit number)
86293957879684002499…49712153828452597759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.725 × 10¹⁰¹(102-digit number)
17258791575936800499…99424307656905195519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.451 × 10¹⁰¹(102-digit number)
34517583151873600999…98848615313810391039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.903 × 10¹⁰¹(102-digit number)
69035166303747201999…97697230627620782079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.380 × 10¹⁰²(103-digit number)
13807033260749440399…95394461255241564159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.761 × 10¹⁰²(103-digit number)
27614066521498880799…90788922510483128319
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,723,721 XPM·at block #6,809,954 · 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