Block #2,010,772

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/6/2017, 10:40:04 AM · Difficulty 10.6980 · 4,804,177 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
61bee5b2b47bab10d62cedbe3fa2d19deb2cf4d3d5de3cf17794e46ee4b08a1f

Height

#2,010,772

Difficulty

10.698001

Transactions

3

Size

130.15 KB

Version

2

Bits

0ab2b02c

Nonce

1,156,780,811

Timestamp

3/6/2017, 10:40:04 AM

Confirmations

4,804,177

Merkle Root

2a81d053c9ece7b4f33c958a0dd370040ea988b29d67ab40a8332d05633786d3
Transactions (3)
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.113 × 10⁹⁴(95-digit number)
11132285412608880867…49488829230702025001
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.113 × 10⁹⁴(95-digit number)
11132285412608880867…49488829230702025001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.226 × 10⁹⁴(95-digit number)
22264570825217761734…98977658461404050001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.452 × 10⁹⁴(95-digit number)
44529141650435523469…97955316922808100001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.905 × 10⁹⁴(95-digit number)
89058283300871046938…95910633845616200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.781 × 10⁹⁵(96-digit number)
17811656660174209387…91821267691232400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.562 × 10⁹⁵(96-digit number)
35623313320348418775…83642535382464800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.124 × 10⁹⁵(96-digit number)
71246626640696837551…67285070764929600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.424 × 10⁹⁶(97-digit number)
14249325328139367510…34570141529859200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.849 × 10⁹⁶(97-digit number)
28498650656278735020…69140283059718400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.699 × 10⁹⁶(97-digit number)
56997301312557470040…38280566119436800001
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,763,689 XPM·at block #6,814,948 · 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