Block #384,434

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/1/2014, 2:51:12 AM · Difficulty 10.4017 · 6,442,528 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
79da9803b4dfcad92ffabd14362552de090bef2d61fbaf81315ab77c49416cad

Height

#384,434

Difficulty

10.401689

Transactions

5

Size

2.39 KB

Version

2

Bits

0a66d516

Nonce

2,827

Timestamp

2/1/2014, 2:51:12 AM

Confirmations

6,442,528

Merkle Root

6d6cae4142ffad1cc4ba3e942101b4fe97d5b4215810704b97587d371b055178
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.981 × 10⁹⁸(99-digit number)
29815746842272601255…55064057545735654401
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.981 × 10⁹⁸(99-digit number)
29815746842272601255…55064057545735654401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.963 × 10⁹⁸(99-digit number)
59631493684545202511…10128115091471308801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.192 × 10⁹⁹(100-digit number)
11926298736909040502…20256230182942617601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.385 × 10⁹⁹(100-digit number)
23852597473818081004…40512460365885235201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.770 × 10⁹⁹(100-digit number)
47705194947636162009…81024920731770470401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.541 × 10⁹⁹(100-digit number)
95410389895272324018…62049841463540940801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.908 × 10¹⁰⁰(101-digit number)
19082077979054464803…24099682927081881601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.816 × 10¹⁰⁰(101-digit number)
38164155958108929607…48199365854163763201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.632 × 10¹⁰⁰(101-digit number)
76328311916217859214…96398731708327526401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.526 × 10¹⁰¹(102-digit number)
15265662383243571842…92797463416655052801
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,859,872 XPM·at block #6,826,961 · 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