Block #464,986

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/29/2014, 3:57:50 AM · Difficulty 10.4231 · 6,349,181 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5e81b16a22460873a4c2fe763880b868f5cb732de9854114bf9831cc971eca40

Height

#464,986

Difficulty

10.423131

Transactions

1

Size

867 B

Version

2

Bits

0a6c5254

Nonce

195,141

Timestamp

3/29/2014, 3:57:50 AM

Confirmations

6,349,181

Merkle Root

837007e75c1910629e65cda915ceb6d4f48aae775e1df71cc81e35d5685b9f42
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.189 × 10⁹⁴(95-digit number)
11898505599658701441…67125150621565983521
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.189 × 10⁹⁴(95-digit number)
11898505599658701441…67125150621565983521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.379 × 10⁹⁴(95-digit number)
23797011199317402882…34250301243131967041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.759 × 10⁹⁴(95-digit number)
47594022398634805765…68500602486263934081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.518 × 10⁹⁴(95-digit number)
95188044797269611531…37001204972527868161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.903 × 10⁹⁵(96-digit number)
19037608959453922306…74002409945055736321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.807 × 10⁹⁵(96-digit number)
38075217918907844612…48004819890111472641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.615 × 10⁹⁵(96-digit number)
76150435837815689225…96009639780222945281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.523 × 10⁹⁶(97-digit number)
15230087167563137845…92019279560445890561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.046 × 10⁹⁶(97-digit number)
30460174335126275690…84038559120891781121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.092 × 10⁹⁶(97-digit number)
60920348670252551380…68077118241783562241
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,757,417 XPM·at block #6,814,166 · 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