Block #457,750

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2014, 3:16:31 AM · Difficulty 10.4187 · 6,351,204 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
928e06bcd098dd1d5a5188ad3ec11c0ba9451965bb0ddc615df71ee8660d0982

Height

#457,750

Difficulty

10.418679

Transactions

2

Size

825 B

Version

2

Bits

0a6b2e87

Nonce

128,154

Timestamp

3/24/2014, 3:16:31 AM

Confirmations

6,351,204

Merkle Root

afc24fe2ecac33b8a1d0afc73e9ab4aaa7f49d308736862c75b56cfd1aef9d10
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.

7.105 × 10⁹⁷(98-digit number)
71052755826400969675…23032339204009022081
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
7.105 × 10⁹⁷(98-digit number)
71052755826400969675…23032339204009022081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.421 × 10⁹⁸(99-digit number)
14210551165280193935…46064678408018044161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.842 × 10⁹⁸(99-digit number)
28421102330560387870…92129356816036088321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.684 × 10⁹⁸(99-digit number)
56842204661120775740…84258713632072176641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.136 × 10⁹⁹(100-digit number)
11368440932224155148…68517427264144353281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.273 × 10⁹⁹(100-digit number)
22736881864448310296…37034854528288706561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.547 × 10⁹⁹(100-digit number)
45473763728896620592…74069709056577413121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.094 × 10⁹⁹(100-digit number)
90947527457793241184…48139418113154826241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.818 × 10¹⁰⁰(101-digit number)
18189505491558648236…96278836226309652481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.637 × 10¹⁰⁰(101-digit number)
36379010983117296473…92557672452619304961
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,715,685 XPM·at block #6,808,953 · 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