Block #392,406

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2014, 10:44:18 AM · Difficulty 10.4391 · 6,418,420 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b1dc6d29dd6e92c5d7bda18ab850a275c83694cefa547aaaf730e05ce8ef0408

Height

#392,406

Difficulty

10.439085

Transactions

18

Size

4.24 KB

Version

2

Bits

0a7067e4

Nonce

8,239

Timestamp

2/6/2014, 10:44:18 AM

Confirmations

6,418,420

Merkle Root

47bcc3a8562338defe13029695201f68c0f6fe9d4c187a217674887c6c9acaa9
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.525 × 10⁹⁹(100-digit number)
35252125883661759327…81293309555915149761
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.525 × 10⁹⁹(100-digit number)
35252125883661759327…81293309555915149761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.050 × 10⁹⁹(100-digit number)
70504251767323518655…62586619111830299521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.410 × 10¹⁰⁰(101-digit number)
14100850353464703731…25173238223660599041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.820 × 10¹⁰⁰(101-digit number)
28201700706929407462…50346476447321198081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.640 × 10¹⁰⁰(101-digit number)
56403401413858814924…00692952894642396161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.128 × 10¹⁰¹(102-digit number)
11280680282771762984…01385905789284792321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.256 × 10¹⁰¹(102-digit number)
22561360565543525969…02771811578569584641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.512 × 10¹⁰¹(102-digit number)
45122721131087051939…05543623157139169281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.024 × 10¹⁰¹(102-digit number)
90245442262174103879…11087246314278338561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.804 × 10¹⁰²(103-digit number)
18049088452434820775…22174492628556677121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.609 × 10¹⁰²(103-digit number)
36098176904869641551…44348985257113354241
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,730,702 XPM·at block #6,810,825 · 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