Block #344,410

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/5/2014, 7:13:49 AM · Difficulty 10.1927 · 6,462,691 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
11e63901370d495bd4854772c2d00ca56fb5d4d0626d97d9c1f5fc82d72ab07e

Height

#344,410

Difficulty

10.192721

Transactions

5

Size

2.26 KB

Version

2

Bits

0a315629

Nonce

16,798

Timestamp

1/5/2014, 7:13:49 AM

Confirmations

6,462,691

Merkle Root

ac359f434ab31af9ca76789617bfdc618d8c90b5435bcf5d8896317d8cfb28dc
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.590 × 10¹⁰²(103-digit number)
15909980913070825728…67458463811831580081
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.590 × 10¹⁰²(103-digit number)
15909980913070825728…67458463811831580081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.181 × 10¹⁰²(103-digit number)
31819961826141651456…34916927623663160161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.363 × 10¹⁰²(103-digit number)
63639923652283302913…69833855247326320321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.272 × 10¹⁰³(104-digit number)
12727984730456660582…39667710494652640641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.545 × 10¹⁰³(104-digit number)
25455969460913321165…79335420989305281281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.091 × 10¹⁰³(104-digit number)
50911938921826642331…58670841978610562561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.018 × 10¹⁰⁴(105-digit number)
10182387784365328466…17341683957221125121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.036 × 10¹⁰⁴(105-digit number)
20364775568730656932…34683367914442250241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.072 × 10¹⁰⁴(105-digit number)
40729551137461313864…69366735828884500481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.145 × 10¹⁰⁴(105-digit number)
81459102274922627729…38733471657769000961
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,700,907 XPM·at block #6,807,100 · 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