Block #1,543,018

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/15/2016, 9:04:35 PM · Difficulty 10.6519 · 5,274,455 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c60f225785e82325e5d3b07fd8041de0e5043759a5afc7bfd41606713e6eb953

Height

#1,543,018

Difficulty

10.651936

Transactions

2

Size

3.80 KB

Version

2

Bits

0aa6e54a

Nonce

2,045,750,548

Timestamp

4/15/2016, 9:04:35 PM

Confirmations

5,274,455

Merkle Root

863c3c81da2648ca1dec22f255722b31673f716a3f7df76ee28d0845c0089358
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.385 × 10⁹¹(92-digit number)
73859779466066926882…35644273246854596921
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.385 × 10⁹¹(92-digit number)
73859779466066926882…35644273246854596921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.477 × 10⁹²(93-digit number)
14771955893213385376…71288546493709193841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.954 × 10⁹²(93-digit number)
29543911786426770752…42577092987418387681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.908 × 10⁹²(93-digit number)
59087823572853541505…85154185974836775361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.181 × 10⁹³(94-digit number)
11817564714570708301…70308371949673550721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.363 × 10⁹³(94-digit number)
23635129429141416602…40616743899347101441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.727 × 10⁹³(94-digit number)
47270258858282833204…81233487798694202881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.454 × 10⁹³(94-digit number)
94540517716565666409…62466975597388405761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.890 × 10⁹⁴(95-digit number)
18908103543313133281…24933951194776811521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.781 × 10⁹⁴(95-digit number)
37816207086626266563…49867902389553623041
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,783,836 XPM·at block #6,817,472 · 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