Block #456,844

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/23/2014, 12:20:44 PM · Difficulty 10.4173 · 6,361,186 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
449f1de2eb409ba10b7a6c378a36a092ab99ec698495c1adff7c089b4d3429c4

Height

#456,844

Difficulty

10.417289

Transactions

1

Size

902 B

Version

2

Bits

0a6ad373

Nonce

14,105

Timestamp

3/23/2014, 12:20:44 PM

Confirmations

6,361,186

Merkle Root

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

8.225 × 10⁹⁷(98-digit number)
82258891806021595748…15143141115756858881
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
8.225 × 10⁹⁷(98-digit number)
82258891806021595748…15143141115756858881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.645 × 10⁹⁸(99-digit number)
16451778361204319149…30286282231513717761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.290 × 10⁹⁸(99-digit number)
32903556722408638299…60572564463027435521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.580 × 10⁹⁸(99-digit number)
65807113444817276598…21145128926054871041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.316 × 10⁹⁹(100-digit number)
13161422688963455319…42290257852109742081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.632 × 10⁹⁹(100-digit number)
26322845377926910639…84580515704219484161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.264 × 10⁹⁹(100-digit number)
52645690755853821279…69161031408438968321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.052 × 10¹⁰⁰(101-digit number)
10529138151170764255…38322062816877936641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.105 × 10¹⁰⁰(101-digit number)
21058276302341528511…76644125633755873281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.211 × 10¹⁰⁰(101-digit number)
42116552604683057023…53288251267511746561
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,788,309 XPM·at block #6,818,029 · 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