Block #426,790

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/2/2014, 9:55:01 PM · Difficulty 10.3521 · 6,382,733 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
efb61c6538890b5d2e3827ed682c8511176c8389e93b78508f09e0bfd53ec19e

Height

#426,790

Difficulty

10.352147

Transactions

2

Size

426 B

Version

2

Bits

0a5a2650

Nonce

64,139

Timestamp

3/2/2014, 9:55:01 PM

Confirmations

6,382,733

Merkle Root

35d0afccd58112a35895dd7c53bca67f21002a74eb4a4fddad550abdfe0a9669
Transactions (2)
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.

6.070 × 10⁹⁸(99-digit number)
60708369495306867309…50197654096163273601
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
6.070 × 10⁹⁸(99-digit number)
60708369495306867309…50197654096163273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.214 × 10⁹⁹(100-digit number)
12141673899061373461…00395308192326547201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.428 × 10⁹⁹(100-digit number)
24283347798122746923…00790616384653094401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.856 × 10⁹⁹(100-digit number)
48566695596245493847…01581232769306188801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.713 × 10⁹⁹(100-digit number)
97133391192490987695…03162465538612377601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.942 × 10¹⁰⁰(101-digit number)
19426678238498197539…06324931077224755201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.885 × 10¹⁰⁰(101-digit number)
38853356476996395078…12649862154449510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.770 × 10¹⁰⁰(101-digit number)
77706712953992790156…25299724308899020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.554 × 10¹⁰¹(102-digit number)
15541342590798558031…50599448617798041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.108 × 10¹⁰¹(102-digit number)
31082685181597116062…01198897235596083201
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,720,261 XPM·at block #6,809,522 · 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.

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