Block #517,062

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/29/2014, 5:28:07 PM · Difficulty 10.8501 · 6,300,044 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f5723660dcfc14271bfb3d534ae36b46dd274e7a3d2de51d7593ab65fe11dd8f

Height

#517,062

Difficulty

10.850072

Transactions

5

Size

1.81 KB

Version

2

Bits

0ad99e4f

Nonce

29,766,699

Timestamp

4/29/2014, 5:28:07 PM

Confirmations

6,300,044

Merkle Root

4f234b5901f437dc4cd1090ea4ed0f74936d8d47f02c8b031c5a06d9fac7b4ac
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.252 × 10¹⁰⁰(101-digit number)
12528397184707041152…88435071967396951681
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.252 × 10¹⁰⁰(101-digit number)
12528397184707041152…88435071967396951681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.505 × 10¹⁰⁰(101-digit number)
25056794369414082305…76870143934793903361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.011 × 10¹⁰⁰(101-digit number)
50113588738828164611…53740287869587806721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.002 × 10¹⁰¹(102-digit number)
10022717747765632922…07480575739175613441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.004 × 10¹⁰¹(102-digit number)
20045435495531265844…14961151478351226881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.009 × 10¹⁰¹(102-digit number)
40090870991062531689…29922302956702453761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.018 × 10¹⁰¹(102-digit number)
80181741982125063378…59844605913404907521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.603 × 10¹⁰²(103-digit number)
16036348396425012675…19689211826809815041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.207 × 10¹⁰²(103-digit number)
32072696792850025351…39378423653619630081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.414 × 10¹⁰²(103-digit number)
64145393585700050702…78756847307239260161
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,780,887 XPM·at block #6,817,105 · 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