Block #438,859

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/11/2014, 7:27:30 AM · Difficulty 10.3563 · 6,375,461 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
72a6ceadb1058a48c9f58925218abebda3b513f813a40f8a98074b99d0f44ac4

Height

#438,859

Difficulty

10.356269

Transactions

7

Size

1.96 KB

Version

2

Bits

0a5b3475

Nonce

676,916

Timestamp

3/11/2014, 7:27:30 AM

Confirmations

6,375,461

Merkle Root

78bb1c506d623ed816a888ac62b52e5282d0f829db1e8c15720c2af03f769f27
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.202 × 10¹⁰²(103-digit number)
32028437746350740529…20930529991401144321
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.202 × 10¹⁰²(103-digit number)
32028437746350740529…20930529991401144321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.405 × 10¹⁰²(103-digit number)
64056875492701481058…41861059982802288641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.281 × 10¹⁰³(104-digit number)
12811375098540296211…83722119965604577281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.562 × 10¹⁰³(104-digit number)
25622750197080592423…67444239931209154561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.124 × 10¹⁰³(104-digit number)
51245500394161184846…34888479862418309121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.024 × 10¹⁰⁴(105-digit number)
10249100078832236969…69776959724836618241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.049 × 10¹⁰⁴(105-digit number)
20498200157664473938…39553919449673236481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.099 × 10¹⁰⁴(105-digit number)
40996400315328947877…79107838899346472961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.199 × 10¹⁰⁴(105-digit number)
81992800630657895754…58215677798692945921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.639 × 10¹⁰⁵(106-digit number)
16398560126131579150…16431355597385891841
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,758,624 XPM·at block #6,814,319 · 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