Block #401,667

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/12/2014, 10:24:42 PM · Difficulty 10.4338 · 6,415,572 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
785a7e4e9b1f8f722e67df529a082f45ba4cd05773621dce86a7e431cf35c426

Height

#401,667

Difficulty

10.433754

Transactions

3

Size

653 B

Version

2

Bits

0a6f0a80

Nonce

477,127

Timestamp

2/12/2014, 10:24:42 PM

Confirmations

6,415,572

Merkle Root

490772c22efc19dec61a81ad2d8eee385bd6535c0a0e2581cfa40d554f45383f
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.

4.819 × 10⁹⁵(96-digit number)
48199240674283264993…95225874079404519421
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
4.819 × 10⁹⁵(96-digit number)
48199240674283264993…95225874079404519421
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.639 × 10⁹⁵(96-digit number)
96398481348566529987…90451748158809038841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.927 × 10⁹⁶(97-digit number)
19279696269713305997…80903496317618077681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.855 × 10⁹⁶(97-digit number)
38559392539426611994…61806992635236155361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.711 × 10⁹⁶(97-digit number)
77118785078853223989…23613985270472310721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.542 × 10⁹⁷(98-digit number)
15423757015770644797…47227970540944621441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.084 × 10⁹⁷(98-digit number)
30847514031541289595…94455941081889242881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.169 × 10⁹⁷(98-digit number)
61695028063082579191…88911882163778485761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.233 × 10⁹⁸(99-digit number)
12339005612616515838…77823764327556971521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.467 × 10⁹⁸(99-digit number)
24678011225233031676…55647528655113943041
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,781,944 XPM·at block #6,817,238 · 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