Block #1,704,717

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/6/2016, 3:09:56 AM · Difficulty 10.6626 · 5,109,228 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cb388b73ced09e510bb50d88cf3606cbfc721dd66b5427fbbfe5ce0f23ba9d97

Height

#1,704,717

Difficulty

10.662558

Transactions

18

Size

5.48 KB

Version

2

Bits

0aa99d6a

Nonce

1,020,003,391

Timestamp

8/6/2016, 3:09:56 AM

Confirmations

5,109,228

Merkle Root

a6adf15e381673540b3d1374d1e00d7600eee4d896ce66dd7910b61b1704587d
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.007 × 10⁹⁶(97-digit number)
70073265191339212720…88195697749654743041
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.007 × 10⁹⁶(97-digit number)
70073265191339212720…88195697749654743041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.401 × 10⁹⁷(98-digit number)
14014653038267842544…76391395499309486081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.802 × 10⁹⁷(98-digit number)
28029306076535685088…52782790998618972161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.605 × 10⁹⁷(98-digit number)
56058612153071370176…05565581997237944321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.121 × 10⁹⁸(99-digit number)
11211722430614274035…11131163994475888641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.242 × 10⁹⁸(99-digit number)
22423444861228548070…22262327988951777281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.484 × 10⁹⁸(99-digit number)
44846889722457096141…44524655977903554561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.969 × 10⁹⁸(99-digit number)
89693779444914192282…89049311955807109121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.793 × 10⁹⁹(100-digit number)
17938755888982838456…78098623911614218241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.587 × 10⁹⁹(100-digit number)
35877511777965676913…56197247823228436481
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,755,638 XPM·at block #6,813,944 · 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