Block #396,752

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/9/2014, 2:51:18 PM · Difficulty 10.4151 · 6,421,107 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7c46a4060e7b708a39164f2d50894ca5c331ac6a372d0fd48565052bef5f9569

Height

#396,752

Difficulty

10.415058

Transactions

9

Size

3.16 KB

Version

2

Bits

0a6a4137

Nonce

42,990

Timestamp

2/9/2014, 2:51:18 PM

Confirmations

6,421,107

Merkle Root

2b392def6267d4ba797abe2df754a38c8df0edf0bcc6b966edd3172df8f0e555
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.825 × 10⁹⁹(100-digit number)
18259574823852695365…08738556600569023601
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.825 × 10⁹⁹(100-digit number)
18259574823852695365…08738556600569023601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.651 × 10⁹⁹(100-digit number)
36519149647705390730…17477113201138047201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.303 × 10⁹⁹(100-digit number)
73038299295410781461…34954226402276094401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.460 × 10¹⁰⁰(101-digit number)
14607659859082156292…69908452804552188801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.921 × 10¹⁰⁰(101-digit number)
29215319718164312584…39816905609104377601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.843 × 10¹⁰⁰(101-digit number)
58430639436328625169…79633811218208755201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.168 × 10¹⁰¹(102-digit number)
11686127887265725033…59267622436417510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.337 × 10¹⁰¹(102-digit number)
23372255774531450067…18535244872835020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.674 × 10¹⁰¹(102-digit number)
46744511549062900135…37070489745670041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.348 × 10¹⁰¹(102-digit number)
93489023098125800271…74140979491340083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.869 × 10¹⁰²(103-digit number)
18697804619625160054…48281958982680166401
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,786,939 XPM·at block #6,817,858 · 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