Block #599,350

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/23/2014, 1:04:26 PM · Difficulty 10.9271 · 6,208,494 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5826d5c125a430fa5f797fa84b6f835122168fc40457e61a586c39d67b026bc7

Height

#599,350

Difficulty

10.927070

Transactions

9

Size

2.69 KB

Version

2

Bits

0aed547e

Nonce

582,105,730

Timestamp

6/23/2014, 1:04:26 PM

Confirmations

6,208,494

Merkle Root

20d813df6b96f92e1bfef2116e1615feaa3f6886731a82d2165553130ad5f176
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.

7.071 × 10⁹⁹(100-digit number)
70712943825413072505…79980701819781862401
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
7.071 × 10⁹⁹(100-digit number)
70712943825413072505…79980701819781862401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.414 × 10¹⁰⁰(101-digit number)
14142588765082614501…59961403639563724801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.828 × 10¹⁰⁰(101-digit number)
28285177530165229002…19922807279127449601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.657 × 10¹⁰⁰(101-digit number)
56570355060330458004…39845614558254899201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.131 × 10¹⁰¹(102-digit number)
11314071012066091600…79691229116509798401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.262 × 10¹⁰¹(102-digit number)
22628142024132183201…59382458233019596801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.525 × 10¹⁰¹(102-digit number)
45256284048264366403…18764916466039193601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.051 × 10¹⁰¹(102-digit number)
90512568096528732807…37529832932078387201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.810 × 10¹⁰²(103-digit number)
18102513619305746561…75059665864156774401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.620 × 10¹⁰²(103-digit number)
36205027238611493122…50119331728313548801
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,706,790 XPM·at block #6,807,843 · 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