Block #401,341

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/12/2014, 4:55:48 PM · Difficulty 10.4335 · 6,415,635 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
02c701972ea9276073396021fc3caeeb65404784461345e0728f162a73a51f1b

Height

#401,341

Difficulty

10.433537

Transactions

9

Size

2.71 KB

Version

2

Bits

0a6efc4f

Nonce

134,076

Timestamp

2/12/2014, 4:55:48 PM

Confirmations

6,415,635

Merkle Root

fd68b34fe3d2e518baa42fa29d392834c3ed71567adf8c23c34cf5b722e1a453
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.

3.007 × 10⁹⁹(100-digit number)
30078288534144609712…79735820547189678081
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
3.007 × 10⁹⁹(100-digit number)
30078288534144609712…79735820547189678081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.015 × 10⁹⁹(100-digit number)
60156577068289219424…59471641094379356161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.203 × 10¹⁰⁰(101-digit number)
12031315413657843884…18943282188758712321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.406 × 10¹⁰⁰(101-digit number)
24062630827315687769…37886564377517424641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.812 × 10¹⁰⁰(101-digit number)
48125261654631375539…75773128755034849281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.625 × 10¹⁰⁰(101-digit number)
96250523309262751078…51546257510069698561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.925 × 10¹⁰¹(102-digit number)
19250104661852550215…03092515020139397121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.850 × 10¹⁰¹(102-digit number)
38500209323705100431…06185030040278794241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.700 × 10¹⁰¹(102-digit number)
77000418647410200862…12370060080557588481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.540 × 10¹⁰²(103-digit number)
15400083729482040172…24740120161115176961
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,779,846 XPM·at block #6,816,975 · 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