Block #321,069

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/20/2013, 2:09:55 AM · Difficulty 10.1862 · 6,504,119 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
04364cd4f7579eab121136bedd488e9174d0a27f618b5c2de93b038474892bee

Height

#321,069

Difficulty

10.186236

Transactions

1

Size

1.08 KB

Version

2

Bits

0a2fad24

Nonce

98,375

Timestamp

12/20/2013, 2:09:55 AM

Confirmations

6,504,119

Merkle Root

eac283aadad2d287865ac27aa58e1dfd6d251e1c77516bd4ba9a181740f13663
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.407 × 10¹⁰¹(102-digit number)
54076415024196061271…52576832331857072619
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.407 × 10¹⁰¹(102-digit number)
54076415024196061271…52576832331857072619
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.081 × 10¹⁰²(103-digit number)
10815283004839212254…05153664663714145239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.163 × 10¹⁰²(103-digit number)
21630566009678424508…10307329327428290479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.326 × 10¹⁰²(103-digit number)
43261132019356849017…20614658654856580959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.652 × 10¹⁰²(103-digit number)
86522264038713698034…41229317309713161919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.730 × 10¹⁰³(104-digit number)
17304452807742739606…82458634619426323839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.460 × 10¹⁰³(104-digit number)
34608905615485479213…64917269238852647679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.921 × 10¹⁰³(104-digit number)
69217811230970958427…29834538477705295359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.384 × 10¹⁰⁴(105-digit number)
13843562246194191685…59669076955410590719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.768 × 10¹⁰⁴(105-digit number)
27687124492388383371…19338153910821181439
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,845,595 XPM·at block #6,825,187 · 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