Block #362,098

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/16/2014, 12:18:47 PM · Difficulty 10.4103 · 6,444,479 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c2e4b5b5fa38177acfb1ebe2fee210e9d9194ae82f664d3752e41e9e0260bdbe

Height

#362,098

Difficulty

10.410301

Transactions

2

Size

1.20 KB

Version

2

Bits

0a69097d

Nonce

294,200

Timestamp

1/16/2014, 12:18:47 PM

Confirmations

6,444,479

Merkle Root

3c1e5141712fac05059355d92b9a6df175726477f64db1e30ce91f8270554682
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.961 × 10¹⁰²(103-digit number)
59616711617163428426…65307179589689927679
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.961 × 10¹⁰²(103-digit number)
59616711617163428426…65307179589689927679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.192 × 10¹⁰³(104-digit number)
11923342323432685685…30614359179379855359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.384 × 10¹⁰³(104-digit number)
23846684646865371370…61228718358759710719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.769 × 10¹⁰³(104-digit number)
47693369293730742741…22457436717519421439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.538 × 10¹⁰³(104-digit number)
95386738587461485482…44914873435038842879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.907 × 10¹⁰⁴(105-digit number)
19077347717492297096…89829746870077685759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.815 × 10¹⁰⁴(105-digit number)
38154695434984594192…79659493740155371519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.630 × 10¹⁰⁴(105-digit number)
76309390869969188385…59318987480310743039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.526 × 10¹⁰⁵(106-digit number)
15261878173993837677…18637974960621486079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.052 × 10¹⁰⁵(106-digit number)
30523756347987675354…37275949921242972159
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,696,711 XPM·at block #6,806,576 · 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