Block #347,757

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/7/2014, 10:00:52 AM · Difficulty 10.2406 · 6,462,543 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
05b1f99a5313910f9adc94a4927e70feff485766737d69a41dcef50e9c460b2a

Height

#347,757

Difficulty

10.240577

Transactions

2

Size

1.26 KB

Version

2

Bits

0a3d9670

Nonce

529,927

Timestamp

1/7/2014, 10:00:52 AM

Confirmations

6,462,543

Merkle Root

621d6232277a0c276ad6581376ccfe9d5d75374bce6bcaa819056739ac42bdaa
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.

3.106 × 10⁹⁴(95-digit number)
31066631530239859585…17149287948481771199
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
3.106 × 10⁹⁴(95-digit number)
31066631530239859585…17149287948481771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.213 × 10⁹⁴(95-digit number)
62133263060479719170…34298575896963542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.242 × 10⁹⁵(96-digit number)
12426652612095943834…68597151793927084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.485 × 10⁹⁵(96-digit number)
24853305224191887668…37194303587854169599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.970 × 10⁹⁵(96-digit number)
49706610448383775336…74388607175708339199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.941 × 10⁹⁵(96-digit number)
99413220896767550673…48777214351416678399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.988 × 10⁹⁶(97-digit number)
19882644179353510134…97554428702833356799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.976 × 10⁹⁶(97-digit number)
39765288358707020269…95108857405666713599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.953 × 10⁹⁶(97-digit number)
79530576717414040538…90217714811333427199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.590 × 10⁹⁷(98-digit number)
15906115343482808107…80435429622666854399
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,726,477 XPM·at block #6,810,299 · 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