Block #344,872

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/5/2014, 2:00:29 PM · Difficulty 10.2016 · 6,472,760 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f17b2304d2d3e2583c777a12a477fc4e048843fbac7efb12ea1008a9967697fc

Height

#344,872

Difficulty

10.201587

Transactions

17

Size

54.20 KB

Version

2

Bits

0a339b3b

Nonce

20,658

Timestamp

1/5/2014, 2:00:29 PM

Confirmations

6,472,760

Merkle Root

cb7cb780b56ff94f2291ce7382a2e81d09234de0f85cd2fea4e18868ccf86963
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.110 × 10¹⁰²(103-digit number)
11103262817551172811…67616122040235086641
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.110 × 10¹⁰²(103-digit number)
11103262817551172811…67616122040235086641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.220 × 10¹⁰²(103-digit number)
22206525635102345622…35232244080470173281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.441 × 10¹⁰²(103-digit number)
44413051270204691244…70464488160940346561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.882 × 10¹⁰²(103-digit number)
88826102540409382489…40928976321880693121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.776 × 10¹⁰³(104-digit number)
17765220508081876497…81857952643761386241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.553 × 10¹⁰³(104-digit number)
35530441016163752995…63715905287522772481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.106 × 10¹⁰³(104-digit number)
71060882032327505991…27431810575045544961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.421 × 10¹⁰⁴(105-digit number)
14212176406465501198…54863621150091089921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.842 × 10¹⁰⁴(105-digit number)
28424352812931002396…09727242300182179841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.684 × 10¹⁰⁴(105-digit number)
56848705625862004793…19454484600364359681
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,785,108 XPM·at block #6,817,631 · 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