Block #448,867

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/18/2014, 6:02:59 AM · Difficulty 10.3637 · 6,375,733 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
701374f41bc46b20c816793470b7c60d7aa4d103d2a76aa96affa5bd03d3b186

Height

#448,867

Difficulty

10.363664

Transactions

9

Size

2.68 KB

Version

2

Bits

0a5d1911

Nonce

9,178

Timestamp

3/18/2014, 6:02:59 AM

Confirmations

6,375,733

Merkle Root

3de83cca4160337ac5ff893bbd17432ddc8add92df1a6624cb761534fca2553c
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.

8.158 × 10⁹⁶(97-digit number)
81585439807476922333…96983806411261847501
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
8.158 × 10⁹⁶(97-digit number)
81585439807476922333…96983806411261847501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.631 × 10⁹⁷(98-digit number)
16317087961495384466…93967612822523695001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.263 × 10⁹⁷(98-digit number)
32634175922990768933…87935225645047390001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.526 × 10⁹⁷(98-digit number)
65268351845981537867…75870451290094780001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.305 × 10⁹⁸(99-digit number)
13053670369196307573…51740902580189560001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.610 × 10⁹⁸(99-digit number)
26107340738392615146…03481805160379120001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.221 × 10⁹⁸(99-digit number)
52214681476785230293…06963610320758240001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.044 × 10⁹⁹(100-digit number)
10442936295357046058…13927220641516480001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.088 × 10⁹⁹(100-digit number)
20885872590714092117…27854441283032960001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.177 × 10⁹⁹(100-digit number)
41771745181428184234…55708882566065920001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.354 × 10⁹⁹(100-digit number)
83543490362856368469…11417765132131840001
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,840,870 XPM·at block #6,824,599 · 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