Block #403,462

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/14/2014, 5:04:41 AM · Difficulty 10.4286 · 6,407,598 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
96acbcd513bbbad1d641f140139a813920e8f3d3d0dde57cafe31c8b599c0f5e

Height

#403,462

Difficulty

10.428631

Transactions

2

Size

434 B

Version

2

Bits

0a6dbac5

Nonce

26,066

Timestamp

2/14/2014, 5:04:41 AM

Confirmations

6,407,598

Merkle Root

183346f3321e22db7120ce826fde5b3d23107aff5263458c94652221cad85c9c
Transactions (2)
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.546 × 10⁹⁸(99-digit number)
35467813028690463924…41264700284897278881
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.546 × 10⁹⁸(99-digit number)
35467813028690463924…41264700284897278881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.093 × 10⁹⁸(99-digit number)
70935626057380927849…82529400569794557761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.418 × 10⁹⁹(100-digit number)
14187125211476185569…65058801139589115521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.837 × 10⁹⁹(100-digit number)
28374250422952371139…30117602279178231041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.674 × 10⁹⁹(100-digit number)
56748500845904742279…60235204558356462081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.134 × 10¹⁰⁰(101-digit number)
11349700169180948455…20470409116712924161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.269 × 10¹⁰⁰(101-digit number)
22699400338361896911…40940818233425848321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.539 × 10¹⁰⁰(101-digit number)
45398800676723793823…81881636466851696641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.079 × 10¹⁰⁰(101-digit number)
90797601353447587647…63763272933703393281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.815 × 10¹⁰¹(102-digit number)
18159520270689517529…27526545867406786561
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,732,585 XPM·at block #6,811,059 · 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