Block #343,181

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/4/2014, 12:57:53 PM · Difficulty 10.1711 · 6,482,462 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
70780dbb112261773e24092c66468e5c97d41d296c02e666c31457c07c18bca8

Height

#343,181

Difficulty

10.171092

Transactions

7

Size

2.82 KB

Version

2

Bits

0a2bccaf

Nonce

358,180

Timestamp

1/4/2014, 12:57:53 PM

Confirmations

6,482,462

Merkle Root

8ed0e4f9726b7bad0ed4fcb91b70f87eed62209e2e42b1d149458ab77794ab50
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.013 × 10⁹³(94-digit number)
80131378634875710689…06155860181926716351
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.013 × 10⁹³(94-digit number)
80131378634875710689…06155860181926716351
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.602 × 10⁹⁴(95-digit number)
16026275726975142137…12311720363853432701
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.205 × 10⁹⁴(95-digit number)
32052551453950284275…24623440727706865401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.410 × 10⁹⁴(95-digit number)
64105102907900568551…49246881455413730801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.282 × 10⁹⁵(96-digit number)
12821020581580113710…98493762910827461601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.564 × 10⁹⁵(96-digit number)
25642041163160227420…96987525821654923201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.128 × 10⁹⁵(96-digit number)
51284082326320454841…93975051643309846401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.025 × 10⁹⁶(97-digit number)
10256816465264090968…87950103286619692801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.051 × 10⁹⁶(97-digit number)
20513632930528181936…75900206573239385601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.102 × 10⁹⁶(97-digit number)
41027265861056363873…51800413146478771201
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,849,249 XPM·at block #6,825,642 · 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