Block #1,544,650

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2016, 11:54:19 PM · Difficulty 10.6536 · 5,265,918 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
664eedd04eb1fb2362256baa42c0043d4acd846f714cb545b227bf4c46a64ed9

Height

#1,544,650

Difficulty

10.653561

Transactions

31

Size

10.06 KB

Version

2

Bits

0aa74fc3

Nonce

183,607,178

Timestamp

4/16/2016, 11:54:19 PM

Confirmations

5,265,918

Merkle Root

f62cdf9650ff4cd9b6246db2128ff15602b72a0046a47fdca79112e93579fcd4
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.817 × 10⁹⁴(95-digit number)
78179818897095330135…31211012075997546721
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.817 × 10⁹⁴(95-digit number)
78179818897095330135…31211012075997546721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.563 × 10⁹⁵(96-digit number)
15635963779419066027…62422024151995093441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.127 × 10⁹⁵(96-digit number)
31271927558838132054…24844048303990186881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.254 × 10⁹⁵(96-digit number)
62543855117676264108…49688096607980373761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.250 × 10⁹⁶(97-digit number)
12508771023535252821…99376193215960747521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.501 × 10⁹⁶(97-digit number)
25017542047070505643…98752386431921495041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.003 × 10⁹⁶(97-digit number)
50035084094141011286…97504772863842990081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.000 × 10⁹⁷(98-digit number)
10007016818828202257…95009545727685980161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.001 × 10⁹⁷(98-digit number)
20014033637656404514…90019091455371960321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.002 × 10⁹⁷(98-digit number)
40028067275312809029…80038182910743920641
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,728,635 XPM·at block #6,810,567 · 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