Block #348,202

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/7/2014, 4:11:30 PM · Difficulty 10.2512 · 6,467,594 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b17854b5157813ec8ea7fd7a36c0a2d03db95bc965d5d280b0941f87a07105a1

Height

#348,202

Difficulty

10.251233

Transactions

7

Size

2.04 KB

Version

2

Bits

0a4050d0

Nonce

70,588

Timestamp

1/7/2014, 4:11:30 PM

Confirmations

6,467,594

Merkle Root

0f5bcbe38cef2f4d1f68ff7509c44db25426d3db8f99aa4d45e3d3f8b8eeea64
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.

7.025 × 10⁹⁸(99-digit number)
70256362426731499629…53214744264218888399
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
7.025 × 10⁹⁸(99-digit number)
70256362426731499629…53214744264218888399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.405 × 10⁹⁹(100-digit number)
14051272485346299925…06429488528437776799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.810 × 10⁹⁹(100-digit number)
28102544970692599851…12858977056875553599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.620 × 10⁹⁹(100-digit number)
56205089941385199703…25717954113751107199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.124 × 10¹⁰⁰(101-digit number)
11241017988277039940…51435908227502214399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.248 × 10¹⁰⁰(101-digit number)
22482035976554079881…02871816455004428799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.496 × 10¹⁰⁰(101-digit number)
44964071953108159762…05743632910008857599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.992 × 10¹⁰⁰(101-digit number)
89928143906216319525…11487265820017715199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.798 × 10¹⁰¹(102-digit number)
17985628781243263905…22974531640035430399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.597 × 10¹⁰¹(102-digit number)
35971257562486527810…45949063280070860799
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,770,472 XPM·at block #6,815,795 · 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