Block #358,787

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2014, 8:37:19 AM · Difficulty 10.3845 · 6,467,325 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
88320314fce66aebfbb6478c3e6b506856e1cf69d6956c30f4af1044e1c91d2f

Height

#358,787

Difficulty

10.384465

Transactions

5

Size

2.09 KB

Version

2

Bits

0a626c49

Nonce

28,277

Timestamp

1/14/2014, 8:37:19 AM

Confirmations

6,467,325

Merkle Root

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

2.362 × 10⁹⁹(100-digit number)
23621062913080221594…34026432265378105599
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
2.362 × 10⁹⁹(100-digit number)
23621062913080221594…34026432265378105599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.724 × 10⁹⁹(100-digit number)
47242125826160443188…68052864530756211199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.448 × 10⁹⁹(100-digit number)
94484251652320886376…36105729061512422399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.889 × 10¹⁰⁰(101-digit number)
18896850330464177275…72211458123024844799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.779 × 10¹⁰⁰(101-digit number)
37793700660928354550…44422916246049689599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.558 × 10¹⁰⁰(101-digit number)
75587401321856709101…88845832492099379199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.511 × 10¹⁰¹(102-digit number)
15117480264371341820…77691664984198758399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.023 × 10¹⁰¹(102-digit number)
30234960528742683640…55383329968397516799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.046 × 10¹⁰¹(102-digit number)
60469921057485367281…10766659936795033599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.209 × 10¹⁰²(103-digit number)
12093984211497073456…21533319873590067199
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,853,020 XPM·at block #6,826,111 · 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