Block #469,854

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/1/2014, 12:53:23 PM · Difficulty 10.4267 · 6,355,612 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8d73aa17da97a8b03f2974f3e692bd269345a50499c6e17670ec02d7b1f8382c

Height

#469,854

Difficulty

10.426685

Transactions

6

Size

1.42 KB

Version

2

Bits

0a6d3b33

Nonce

5,184

Timestamp

4/1/2014, 12:53:23 PM

Confirmations

6,355,612

Merkle Root

f61fe1d2ce3d559a87eb321d9b2f07277ca15653dfc2cdf51f0c0aa7aaab9b64
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.073 × 10¹⁰⁰(101-digit number)
30733370122429022702…00233192162361643521
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.073 × 10¹⁰⁰(101-digit number)
30733370122429022702…00233192162361643521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.146 × 10¹⁰⁰(101-digit number)
61466740244858045405…00466384324723287041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.229 × 10¹⁰¹(102-digit number)
12293348048971609081…00932768649446574081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.458 × 10¹⁰¹(102-digit number)
24586696097943218162…01865537298893148161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.917 × 10¹⁰¹(102-digit number)
49173392195886436324…03731074597786296321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.834 × 10¹⁰¹(102-digit number)
98346784391772872648…07462149195572592641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.966 × 10¹⁰²(103-digit number)
19669356878354574529…14924298391145185281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.933 × 10¹⁰²(103-digit number)
39338713756709149059…29848596782290370561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.867 × 10¹⁰²(103-digit number)
78677427513418298118…59697193564580741121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.573 × 10¹⁰³(104-digit number)
15735485502683659623…19394387129161482241
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,847,831 XPM·at block #6,825,465 · 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