Block #343,213

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/4/2014, 1:29:47 PM · Difficulty 10.1734 · 6,482,833 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
69306c1c36c6f655561fb07bef48ea2d52817b42c07b4c4ab1384c15ff87c618

Height

#343,213

Difficulty

10.173421

Transactions

6

Size

1.45 KB

Version

2

Bits

0a2c6557

Nonce

29,770

Timestamp

1/4/2014, 1:29:47 PM

Confirmations

6,482,833

Merkle Root

2adc4f7cd813c23cb6764a4a0c80ac278f9561a445636da474ba3ca4e2015241
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.426 × 10¹⁰²(103-digit number)
14260840040403811142…18062685339996441601
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.426 × 10¹⁰²(103-digit number)
14260840040403811142…18062685339996441601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.852 × 10¹⁰²(103-digit number)
28521680080807622285…36125370679992883201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.704 × 10¹⁰²(103-digit number)
57043360161615244571…72250741359985766401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.140 × 10¹⁰³(104-digit number)
11408672032323048914…44501482719971532801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.281 × 10¹⁰³(104-digit number)
22817344064646097828…89002965439943065601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.563 × 10¹⁰³(104-digit number)
45634688129292195656…78005930879886131201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.126 × 10¹⁰³(104-digit number)
91269376258584391313…56011861759772262401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.825 × 10¹⁰⁴(105-digit number)
18253875251716878262…12023723519544524801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.650 × 10¹⁰⁴(105-digit number)
36507750503433756525…24047447039089049601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.301 × 10¹⁰⁴(105-digit number)
73015501006867513050…48094894078178099201
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,852,494 XPM·at block #6,826,045 · 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