Block #438,266

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2014, 9:00:12 PM · Difficulty 10.3607 · 6,377,769 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
61d43dd053bd5d2716747cef4dc5259d55030ba1be7fc0dcd7a720af8ea21206

Height

#438,266

Difficulty

10.360681

Transactions

1

Size

968 B

Version

2

Bits

0a5c5592

Nonce

131,493

Timestamp

3/10/2014, 9:00:12 PM

Confirmations

6,377,769

Merkle Root

c7383603df3498229d285d5bd31526194d9f27c5158af7fe63b8b23acfa553b5
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.733 × 10⁹³(94-digit number)
17337698445826738452…20513518041719054081
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.733 × 10⁹³(94-digit number)
17337698445826738452…20513518041719054081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.467 × 10⁹³(94-digit number)
34675396891653476905…41027036083438108161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.935 × 10⁹³(94-digit number)
69350793783306953810…82054072166876216321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.387 × 10⁹⁴(95-digit number)
13870158756661390762…64108144333752432641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.774 × 10⁹⁴(95-digit number)
27740317513322781524…28216288667504865281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.548 × 10⁹⁴(95-digit number)
55480635026645563048…56432577335009730561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.109 × 10⁹⁵(96-digit number)
11096127005329112609…12865154670019461121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.219 × 10⁹⁵(96-digit number)
22192254010658225219…25730309340038922241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.438 × 10⁹⁵(96-digit number)
44384508021316450438…51460618680077844481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.876 × 10⁹⁵(96-digit number)
88769016042632900877…02921237360155688961
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,772,394 XPM·at block #6,816,034 · 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