Block #438,308

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2014, 9:49:06 PM · Difficulty 10.3597 · 6,377,914 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5c9796bcb448d18693f88a84ac32670457e472eda4e4e991828046489539f721

Height

#438,308

Difficulty

10.359717

Transactions

10

Size

2.34 KB

Version

2

Bits

0a5c1671

Nonce

61,407

Timestamp

3/10/2014, 9:49:06 PM

Confirmations

6,377,914

Merkle Root

44cabf6186e94339bb13d34d64e38cabfb2b6475a2fef059eebe8c746a95b0ca
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.118 × 10⁹⁴(95-digit number)
21183530288351264478…40232419895900654721
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.118 × 10⁹⁴(95-digit number)
21183530288351264478…40232419895900654721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.236 × 10⁹⁴(95-digit number)
42367060576702528957…80464839791801309441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.473 × 10⁹⁴(95-digit number)
84734121153405057915…60929679583602618881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.694 × 10⁹⁵(96-digit number)
16946824230681011583…21859359167205237761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.389 × 10⁹⁵(96-digit number)
33893648461362023166…43718718334410475521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.778 × 10⁹⁵(96-digit number)
67787296922724046332…87437436668820951041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.355 × 10⁹⁶(97-digit number)
13557459384544809266…74874873337641902081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.711 × 10⁹⁶(97-digit number)
27114918769089618532…49749746675283804161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.422 × 10⁹⁶(97-digit number)
54229837538179237065…99499493350567608321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.084 × 10⁹⁷(98-digit number)
10845967507635847413…98998986701135216641
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,773,904 XPM·at block #6,816,221 · 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