Block #392,816

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/6/2014, 5:06:54 PM · Difficulty 10.4418 · 6,418,321 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e2bba4a4e7d28d8f28d6ba17a5620a4ebdaf20f8529054b8964bd66d31681a08

Height

#392,816

Difficulty

10.441825

Transactions

5

Size

1.09 KB

Version

2

Bits

0a711b72

Nonce

18,858

Timestamp

2/6/2014, 5:06:54 PM

Confirmations

6,418,321

Merkle Root

a97859eb2d27bf57a38867725f22fe19d71d09c0621a30a89915314d400c44a9
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.

1.855 × 10¹⁰⁰(101-digit number)
18553044268339659929…46450847221220966399
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
1.855 × 10¹⁰⁰(101-digit number)
18553044268339659929…46450847221220966399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.710 × 10¹⁰⁰(101-digit number)
37106088536679319858…92901694442441932799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.421 × 10¹⁰⁰(101-digit number)
74212177073358639717…85803388884883865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.484 × 10¹⁰¹(102-digit number)
14842435414671727943…71606777769767731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.968 × 10¹⁰¹(102-digit number)
29684870829343455886…43213555539535462399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.936 × 10¹⁰¹(102-digit number)
59369741658686911773…86427111079070924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.187 × 10¹⁰²(103-digit number)
11873948331737382354…72854222158141849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.374 × 10¹⁰²(103-digit number)
23747896663474764709…45708444316283699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.749 × 10¹⁰²(103-digit number)
47495793326949529419…91416888632567398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.499 × 10¹⁰²(103-digit number)
94991586653899058838…82833777265134796799
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,733,204 XPM·at block #6,811,136 · 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