Block #347,790

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/7/2014, 10:32:27 AM · Difficulty 10.2404 · 6,469,380 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
63fdf82c8793e8009a410f21f6f532187ec9de31f338525362aef2b3316064bc

Height

#347,790

Difficulty

10.240377

Transactions

4

Size

3.20 KB

Version

2

Bits

0a3d8960

Nonce

213,662

Timestamp

1/7/2014, 10:32:27 AM

Confirmations

6,469,380

Merkle Root

96d21f47948d36d941a576832095677861f8b44570068bf4d0d2f39cc49d03c5
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.801 × 10⁹³(94-digit number)
28012997793949785289…21881642246877730881
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.801 × 10⁹³(94-digit number)
28012997793949785289…21881642246877730881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.602 × 10⁹³(94-digit number)
56025995587899570579…43763284493755461761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.120 × 10⁹⁴(95-digit number)
11205199117579914115…87526568987510923521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.241 × 10⁹⁴(95-digit number)
22410398235159828231…75053137975021847041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.482 × 10⁹⁴(95-digit number)
44820796470319656463…50106275950043694081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.964 × 10⁹⁴(95-digit number)
89641592940639312927…00212551900087388161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.792 × 10⁹⁵(96-digit number)
17928318588127862585…00425103800174776321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.585 × 10⁹⁵(96-digit number)
35856637176255725170…00850207600349552641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.171 × 10⁹⁵(96-digit number)
71713274352511450341…01700415200699105281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.434 × 10⁹⁶(97-digit number)
14342654870502290068…03400830401398210561
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,781,395 XPM·at block #6,817,169 · 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