Block #462,290

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/27/2014, 8:41:40 AM · Difficulty 10.4094 · 6,374,402 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
75395d3198a19684d0c24e3e925c798d5601081c1f268331262a2e37763884be

Height

#462,290

Difficulty

10.409442

Transactions

4

Size

1.16 KB

Version

2

Bits

0a68d137

Nonce

3,991

Timestamp

3/27/2014, 8:41:40 AM

Confirmations

6,374,402

Merkle Root

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

2.711 × 10¹⁰⁴(105-digit number)
27113672809950891724…95810125524348436481
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
2.711 × 10¹⁰⁴(105-digit number)
27113672809950891724…95810125524348436481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.422 × 10¹⁰⁴(105-digit number)
54227345619901783448…91620251048696872961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.084 × 10¹⁰⁵(106-digit number)
10845469123980356689…83240502097393745921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.169 × 10¹⁰⁵(106-digit number)
21690938247960713379…66481004194787491841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.338 × 10¹⁰⁵(106-digit number)
43381876495921426758…32962008389574983681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.676 × 10¹⁰⁵(106-digit number)
86763752991842853516…65924016779149967361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.735 × 10¹⁰⁶(107-digit number)
17352750598368570703…31848033558299934721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.470 × 10¹⁰⁶(107-digit number)
34705501196737141406…63696067116599869441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.941 × 10¹⁰⁶(107-digit number)
69411002393474282813…27392134233199738881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.388 × 10¹⁰⁷(108-digit number)
13882200478694856562…54784268466399477761
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,937,816 XPM·at block #6,836,691 · 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