Block #1,668,606

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/11/2016, 3:35:40 PM · Difficulty 10.6982 · 5,169,021 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a9a8db272f89938e1cc730d3d8f75757ce8b9368f0a94e0a4e0e662eece2a0ae

Height

#1,668,606

Difficulty

10.698161

Transactions

2

Size

575 B

Version

2

Bits

0ab2baa7

Nonce

774,584,315

Timestamp

7/11/2016, 3:35:40 PM

Confirmations

5,169,021

Merkle Root

b504c9afedaef7c2ded543260bf3c46050631b6e2d67efbb0a0499863359a650
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.

5.513 × 10⁹⁶(97-digit number)
55130066184896934864…16929645385031833601
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
5.513 × 10⁹⁶(97-digit number)
55130066184896934864…16929645385031833601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.102 × 10⁹⁷(98-digit number)
11026013236979386972…33859290770063667201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.205 × 10⁹⁷(98-digit number)
22052026473958773945…67718581540127334401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.410 × 10⁹⁷(98-digit number)
44104052947917547891…35437163080254668801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.820 × 10⁹⁷(98-digit number)
88208105895835095783…70874326160509337601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.764 × 10⁹⁸(99-digit number)
17641621179167019156…41748652321018675201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.528 × 10⁹⁸(99-digit number)
35283242358334038313…83497304642037350401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.056 × 10⁹⁸(99-digit number)
70566484716668076626…66994609284074700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.411 × 10⁹⁹(100-digit number)
14113296943333615325…33989218568149401601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.822 × 10⁹⁹(100-digit number)
28226593886667230650…67978437136298803201
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,945,340 XPM·at block #6,837,626 · 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