Block #458,627

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2014, 5:40:49 PM · Difficulty 10.4208 · 6,355,587 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1a5f8fa4eaa68f6bed905401df4274f96ef434ef9aa3af8fc0e0ff4a7cb2f11a

Height

#458,627

Difficulty

10.420767

Transactions

3

Size

619 B

Version

2

Bits

0a6bb75d

Nonce

135,588

Timestamp

3/24/2014, 5:40:49 PM

Confirmations

6,355,587

Merkle Root

b0ef2caaf836bcf7f4955ff740e094558cb7f53be08cdd4e3cd3a2dd9f4c56c5
Transactions (3)
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.280 × 10⁹⁸(99-digit number)
32802581478333122500…30852840497672464801
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.280 × 10⁹⁸(99-digit number)
32802581478333122500…30852840497672464801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.560 × 10⁹⁸(99-digit number)
65605162956666245000…61705680995344929601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.312 × 10⁹⁹(100-digit number)
13121032591333249000…23411361990689859201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.624 × 10⁹⁹(100-digit number)
26242065182666498000…46822723981379718401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.248 × 10⁹⁹(100-digit number)
52484130365332996000…93645447962759436801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.049 × 10¹⁰⁰(101-digit number)
10496826073066599200…87290895925518873601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.099 × 10¹⁰⁰(101-digit number)
20993652146133198400…74581791851037747201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.198 × 10¹⁰⁰(101-digit number)
41987304292266396800…49163583702075494401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.397 × 10¹⁰⁰(101-digit number)
83974608584532793600…98327167404150988801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.679 × 10¹⁰¹(102-digit number)
16794921716906558720…96654334808301977601
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,780 XPM·at block #6,814,213 · 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