Block #349,630

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2014, 1:08:48 PM · Difficulty 10.2765 · 6,475,272 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
efb7abf5a9c4da8bb6e3e5b17e80390bc17be8751d569af9e01dcd02cd6917cc

Height

#349,630

Difficulty

10.276548

Transactions

8

Size

6.84 KB

Version

2

Bits

0a46cbd2

Nonce

177,543

Timestamp

1/8/2014, 1:08:48 PM

Confirmations

6,475,272

Merkle Root

f96fbf0b72bba289a9ba550c6c1e50b9104c2d0194e003d8a10d39582e9dee26
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.094 × 10⁹⁴(95-digit number)
10948447536912021505…90605184576578846399
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.094 × 10⁹⁴(95-digit number)
10948447536912021505…90605184576578846399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.189 × 10⁹⁴(95-digit number)
21896895073824043011…81210369153157692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.379 × 10⁹⁴(95-digit number)
43793790147648086023…62420738306315385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.758 × 10⁹⁴(95-digit number)
87587580295296172046…24841476612630771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.751 × 10⁹⁵(96-digit number)
17517516059059234409…49682953225261542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.503 × 10⁹⁵(96-digit number)
35035032118118468818…99365906450523084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.007 × 10⁹⁵(96-digit number)
70070064236236937637…98731812901046169599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.401 × 10⁹⁶(97-digit number)
14014012847247387527…97463625802092339199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.802 × 10⁹⁶(97-digit number)
28028025694494775054…94927251604184678399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.605 × 10⁹⁶(97-digit number)
56056051388989550109…89854503208369356799
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,843,299 XPM·at block #6,824,901 · 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