Block #424,349

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/1/2014, 4:24:46 AM · Difficulty 10.3575 · 6,402,727 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8a3cb94d0a5f281d6d48d6f9ce7f4e12531826382b871d968b311026219eb6ec

Height

#424,349

Difficulty

10.357480

Transactions

3

Size

4.26 KB

Version

2

Bits

0a5b83cf

Nonce

95,403

Timestamp

3/1/2014, 4:24:46 AM

Confirmations

6,402,727

Merkle Root

a33460c9d8c437978c4faed8a4fce7a833487c133ecb6d33ca5b60e8c386d486
Transactions (3)
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.236 × 10¹⁰²(103-digit number)
12368615509619140509…76679950566092801281
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.236 × 10¹⁰²(103-digit number)
12368615509619140509…76679950566092801281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.473 × 10¹⁰²(103-digit number)
24737231019238281019…53359901132185602561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.947 × 10¹⁰²(103-digit number)
49474462038476562039…06719802264371205121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.894 × 10¹⁰²(103-digit number)
98948924076953124078…13439604528742410241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.978 × 10¹⁰³(104-digit number)
19789784815390624815…26879209057484820481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.957 × 10¹⁰³(104-digit number)
39579569630781249631…53758418114969640961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.915 × 10¹⁰³(104-digit number)
79159139261562499262…07516836229939281921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.583 × 10¹⁰⁴(105-digit number)
15831827852312499852…15033672459878563841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.166 × 10¹⁰⁴(105-digit number)
31663655704624999705…30067344919757127681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.332 × 10¹⁰⁴(105-digit number)
63327311409249999410…60134689839514255361
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,860,792 XPM·at block #6,827,075 · 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