Block #2,168,781

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/20/2017, 12:18:34 PM · Difficulty 10.8984 · 4,645,536 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9c477be2b7259f566f053cb2c7ed4464a4c340c4879a9fb711bf7e53f582f533

Height

#2,168,781

Difficulty

10.898447

Transactions

3

Size

5.01 KB

Version

2

Bits

0ae600a5

Nonce

965,514,914

Timestamp

6/20/2017, 12:18:34 PM

Confirmations

4,645,536

Merkle Root

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

2.100 × 10⁹³(94-digit number)
21006432449797059851…76640413076929318001
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
2.100 × 10⁹³(94-digit number)
21006432449797059851…76640413076929318001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.201 × 10⁹³(94-digit number)
42012864899594119702…53280826153858636001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.402 × 10⁹³(94-digit number)
84025729799188239405…06561652307717272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.680 × 10⁹⁴(95-digit number)
16805145959837647881…13123304615434544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.361 × 10⁹⁴(95-digit number)
33610291919675295762…26246609230869088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.722 × 10⁹⁴(95-digit number)
67220583839350591524…52493218461738176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.344 × 10⁹⁵(96-digit number)
13444116767870118304…04986436923476352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.688 × 10⁹⁵(96-digit number)
26888233535740236609…09972873846952704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.377 × 10⁹⁵(96-digit number)
53776467071480473219…19945747693905408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.075 × 10⁹⁶(97-digit number)
10755293414296094643…39891495387810816001
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,758,599 XPM·at block #6,814,316 · 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