Block #346,348

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/6/2014, 11:59:27 AM · Difficulty 10.2268 · 6,470,460 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ece646a740ef826d04758446498c67c4185872353bfa2ea14a75f8f25b018aa9

Height

#346,348

Difficulty

10.226776

Transactions

6

Size

1.58 KB

Version

2

Bits

0a3a0dfa

Nonce

21,458

Timestamp

1/6/2014, 11:59:27 AM

Confirmations

6,470,460

Merkle Root

5110e9a447f89841a48975f60232d22f16d1a1fa6cd54f5a2dab94b09543a00b
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.

8.499 × 10¹⁰²(103-digit number)
84994007077946971610…00646653453477699999
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
8.499 × 10¹⁰²(103-digit number)
84994007077946971610…00646653453477699999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.699 × 10¹⁰³(104-digit number)
16998801415589394322…01293306906955399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.399 × 10¹⁰³(104-digit number)
33997602831178788644…02586613813910799999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.799 × 10¹⁰³(104-digit number)
67995205662357577288…05173227627821599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.359 × 10¹⁰⁴(105-digit number)
13599041132471515457…10346455255643199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.719 × 10¹⁰⁴(105-digit number)
27198082264943030915…20692910511286399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.439 × 10¹⁰⁴(105-digit number)
54396164529886061830…41385821022572799999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.087 × 10¹⁰⁵(106-digit number)
10879232905977212366…82771642045145599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.175 × 10¹⁰⁵(106-digit number)
21758465811954424732…65543284090291199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.351 × 10¹⁰⁵(106-digit number)
43516931623908849464…31086568180582399999
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,778,501 XPM·at block #6,816,807 · 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