Block #320,216

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/19/2013, 12:28:28 PM · Difficulty 10.1805 · 6,494,733 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8410314fc676912e231e77f7b70257b50e5c1edc009b40e5e0ec071fc4b53f66

Height

#320,216

Difficulty

10.180476

Transactions

4

Size

2.14 KB

Version

2

Bits

0a2e33ac

Nonce

23,448

Timestamp

12/19/2013, 12:28:28 PM

Confirmations

6,494,733

Merkle Root

9843abedeeabde41c9527ca25d71664c33fbff4b2e8a32184d82f63818930b99
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.066 × 10⁹⁹(100-digit number)
40661365294472124616…95858669419439869439
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.066 × 10⁹⁹(100-digit number)
40661365294472124616…95858669419439869439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.132 × 10⁹⁹(100-digit number)
81322730588944249233…91717338838879738879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.626 × 10¹⁰⁰(101-digit number)
16264546117788849846…83434677677759477759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.252 × 10¹⁰⁰(101-digit number)
32529092235577699693…66869355355518955519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.505 × 10¹⁰⁰(101-digit number)
65058184471155399386…33738710711037911039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.301 × 10¹⁰¹(102-digit number)
13011636894231079877…67477421422075822079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.602 × 10¹⁰¹(102-digit number)
26023273788462159754…34954842844151644159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.204 × 10¹⁰¹(102-digit number)
52046547576924319509…69909685688303288319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.040 × 10¹⁰²(103-digit number)
10409309515384863901…39819371376606576639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.081 × 10¹⁰²(103-digit number)
20818619030769727803…79638742753213153279
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,763,689 XPM·at block #6,814,948 · 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