Block #1,702,210

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/4/2016, 7:31:57 AM · Difficulty 10.6700 · 5,123,134 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e56b9fc83c4d25d2eb943d0ff8979afccf10e9e6563e0ef3602a9f365266a6b1

Height

#1,702,210

Difficulty

10.669963

Transactions

2

Size

7.36 KB

Version

2

Bits

0aab82b1

Nonce

682,781,432

Timestamp

8/4/2016, 7:31:57 AM

Confirmations

5,123,134

Merkle Root

76cc8871e759bfd6614ddfca18ff024504516c385d0f9f1783de9b092c6463c9
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.187 × 10⁹⁶(97-digit number)
11875430107943307233…15682634702442496001
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.187 × 10⁹⁶(97-digit number)
11875430107943307233…15682634702442496001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.375 × 10⁹⁶(97-digit number)
23750860215886614467…31365269404884992001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.750 × 10⁹⁶(97-digit number)
47501720431773228934…62730538809769984001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.500 × 10⁹⁶(97-digit number)
95003440863546457869…25461077619539968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.900 × 10⁹⁷(98-digit number)
19000688172709291573…50922155239079936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.800 × 10⁹⁷(98-digit number)
38001376345418583147…01844310478159872001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.600 × 10⁹⁷(98-digit number)
76002752690837166295…03688620956319744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.520 × 10⁹⁸(99-digit number)
15200550538167433259…07377241912639488001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.040 × 10⁹⁸(99-digit number)
30401101076334866518…14754483825278976001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.080 × 10⁹⁸(99-digit number)
60802202152669733036…29508967650557952001
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,846,857 XPM·at block #6,825,343 · 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