Block #491,568

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/14/2014, 2:27:10 PM · Difficulty 10.6823 · 6,323,466 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
343866b1d378be07cf117a44a7e043173ca8eb959a18ce363e82cf53e3ba5482

Height

#491,568

Difficulty

10.682336

Transactions

5

Size

1.09 KB

Version

2

Bits

0aaead99

Nonce

164,532,929

Timestamp

4/14/2014, 2:27:10 PM

Confirmations

6,323,466

Merkle Root

31aafc3876238b36d1cd855e3a0fa480ac636486e6b268bb6645ed9a0cadd9a8
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.220 × 10⁹⁸(99-digit number)
12208824084100833475…44772799214822161921
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.220 × 10⁹⁸(99-digit number)
12208824084100833475…44772799214822161921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.441 × 10⁹⁸(99-digit number)
24417648168201666951…89545598429644323841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.883 × 10⁹⁸(99-digit number)
48835296336403333902…79091196859288647681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.767 × 10⁹⁸(99-digit number)
97670592672806667804…58182393718577295361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.953 × 10⁹⁹(100-digit number)
19534118534561333560…16364787437154590721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.906 × 10⁹⁹(100-digit number)
39068237069122667121…32729574874309181441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.813 × 10⁹⁹(100-digit number)
78136474138245334243…65459149748618362881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.562 × 10¹⁰⁰(101-digit number)
15627294827649066848…30918299497236725761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.125 × 10¹⁰⁰(101-digit number)
31254589655298133697…61836598994473451521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.250 × 10¹⁰⁰(101-digit number)
62509179310596267394…23673197988946903041
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,764,362 XPM·at block #6,815,033 · 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