Block #2,070,387

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/14/2017, 5:15:58 AM · Difficulty 10.8597 · 4,762,461 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5394b805f8bfb1d6b1721fe26e7ad206e2ee823a6d00e624c6d4f9615796ebb4

Height

#2,070,387

Difficulty

10.859681

Transactions

2

Size

3.16 KB

Version

2

Bits

0adc1408

Nonce

1,788,029,144

Timestamp

4/14/2017, 5:15:58 AM

Confirmations

4,762,461

Merkle Root

a8d20a7b9fe536da0b95a6973972208ea580b8f7d61a3f6ea98a896ec2e25e8a
Transactions (2)
1 in → 1 out8.6700 XPM110 B
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.178 × 10⁹⁴(95-digit number)
71780352905620605434…59580276325371481601
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.178 × 10⁹⁴(95-digit number)
71780352905620605434…59580276325371481601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.435 × 10⁹⁵(96-digit number)
14356070581124121086…19160552650742963201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.871 × 10⁹⁵(96-digit number)
28712141162248242173…38321105301485926401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.742 × 10⁹⁵(96-digit number)
57424282324496484347…76642210602971852801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.148 × 10⁹⁶(97-digit number)
11484856464899296869…53284421205943705601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.296 × 10⁹⁶(97-digit number)
22969712929798593739…06568842411887411201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.593 × 10⁹⁶(97-digit number)
45939425859597187478…13137684823774822401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.187 × 10⁹⁶(97-digit number)
91878851719194374956…26275369647549644801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.837 × 10⁹⁷(98-digit number)
18375770343838874991…52550739295099289601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.675 × 10⁹⁷(98-digit number)
36751540687677749982…05101478590198579201
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,906,953 XPM·at block #6,832,847 · 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