Block #344,323

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/5/2014, 5:53:41 AM · Difficulty 10.1920 · 6,463,015 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
be96e14c0782c6d00454e853dd9080f6e9a46fca036b04351a5571711d369183

Height

#344,323

Difficulty

10.191981

Transactions

16

Size

5.82 KB

Version

2

Bits

0a3125a4

Nonce

634,793

Timestamp

1/5/2014, 5:53:41 AM

Confirmations

6,463,015

Merkle Root

618d43720b834b1a5b0657dce4554b7548fec46805a2148e5588801240af79b1
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.332 × 10⁹⁴(95-digit number)
23328121101868645332…55409957388698501121
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.332 × 10⁹⁴(95-digit number)
23328121101868645332…55409957388698501121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.665 × 10⁹⁴(95-digit number)
46656242203737290664…10819914777397002241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.331 × 10⁹⁴(95-digit number)
93312484407474581328…21639829554794004481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.866 × 10⁹⁵(96-digit number)
18662496881494916265…43279659109588008961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.732 × 10⁹⁵(96-digit number)
37324993762989832531…86559318219176017921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.464 × 10⁹⁵(96-digit number)
74649987525979665062…73118636438352035841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.492 × 10⁹⁶(97-digit number)
14929997505195933012…46237272876704071681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.985 × 10⁹⁶(97-digit number)
29859995010391866025…92474545753408143361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.971 × 10⁹⁶(97-digit number)
59719990020783732050…84949091506816286721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.194 × 10⁹⁷(98-digit number)
11943998004156746410…69898183013632573441
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,702,722 XPM·at block #6,807,337 · 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