Block #354,845

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2014, 7:00:58 PM · Difficulty 10.3515 · 6,455,009 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5ed6f3efd40be5a7d42434c63823f4fd1f68c26d5d63ab2ea0e4465714a6989c

Height

#354,845

Difficulty

10.351519

Transactions

5

Size

1.08 KB

Version

2

Bits

0a59fd23

Nonce

53,457

Timestamp

1/11/2014, 7:00:58 PM

Confirmations

6,455,009

Merkle Root

20893e8194fcdfc38bf269248b13b8bf494a767c3ab734c0334334c688b558d4
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.291 × 10⁹⁵(96-digit number)
12914820976649967397…86304423814334238721
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.291 × 10⁹⁵(96-digit number)
12914820976649967397…86304423814334238721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.582 × 10⁹⁵(96-digit number)
25829641953299934795…72608847628668477441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.165 × 10⁹⁵(96-digit number)
51659283906599869591…45217695257336954881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.033 × 10⁹⁶(97-digit number)
10331856781319973918…90435390514673909761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.066 × 10⁹⁶(97-digit number)
20663713562639947836…80870781029347819521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.132 × 10⁹⁶(97-digit number)
41327427125279895673…61741562058695639041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.265 × 10⁹⁶(97-digit number)
82654854250559791347…23483124117391278081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.653 × 10⁹⁷(98-digit number)
16530970850111958269…46966248234782556161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.306 × 10⁹⁷(98-digit number)
33061941700223916538…93932496469565112321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.612 × 10⁹⁷(98-digit number)
66123883400447833077…87864992939130224641
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,722,919 XPM·at block #6,809,853 · 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