Block #1,687,030

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/24/2016, 7:00:14 AM · Difficulty 10.7116 · 5,143,473 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e6061c6c652a0a88957ac3b6c2ac371f12310324e4bf3c634cdd97deae160fe5

Height

#1,687,030

Difficulty

10.711563

Transactions

2

Size

1020 B

Version

2

Bits

0ab628fe

Nonce

145,580,490

Timestamp

7/24/2016, 7:00:14 AM

Confirmations

5,143,473

Merkle Root

737361c739120c94217cfcc31ba89ef90577b0b1c281b27c0f51063f4e7a3390
Transactions (2)
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.270 × 10⁹⁵(96-digit number)
12704238975012321620…23899955600655923201
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.270 × 10⁹⁵(96-digit number)
12704238975012321620…23899955600655923201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.540 × 10⁹⁵(96-digit number)
25408477950024643240…47799911201311846401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.081 × 10⁹⁵(96-digit number)
50816955900049286481…95599822402623692801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.016 × 10⁹⁶(97-digit number)
10163391180009857296…91199644805247385601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.032 × 10⁹⁶(97-digit number)
20326782360019714592…82399289610494771201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.065 × 10⁹⁶(97-digit number)
40653564720039429185…64798579220989542401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.130 × 10⁹⁶(97-digit number)
81307129440078858370…29597158441979084801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.626 × 10⁹⁷(98-digit number)
16261425888015771674…59194316883958169601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.252 × 10⁹⁷(98-digit number)
32522851776031543348…18388633767916339201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.504 × 10⁹⁷(98-digit number)
65045703552063086696…36777267535832678401
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,888,274 XPM·at block #6,830,502 · 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