Block #2,001,262

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/27/2017, 7:06:17 AM · Difficulty 10.7408 · 4,832,231 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9061d2928965a85b75d12527a1d191298a7b2dc21365518c49cbb7f1198dbc4b

Height

#2,001,262

Difficulty

10.740847

Transactions

2

Size

1.57 KB

Version

2

Bits

0abda82d

Nonce

307,301,798

Timestamp

2/27/2017, 7:06:17 AM

Confirmations

4,832,231

Merkle Root

4a9bacb21463e32b54e7ebc406d272758fd2d6bc65543254753ebf0a2c24ed55
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.974 × 10⁹⁶(97-digit number)
19749723207724083787…24585174566037335041
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.974 × 10⁹⁶(97-digit number)
19749723207724083787…24585174566037335041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.949 × 10⁹⁶(97-digit number)
39499446415448167575…49170349132074670081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.899 × 10⁹⁶(97-digit number)
78998892830896335150…98340698264149340161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.579 × 10⁹⁷(98-digit number)
15799778566179267030…96681396528298680321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.159 × 10⁹⁷(98-digit number)
31599557132358534060…93362793056597360641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.319 × 10⁹⁷(98-digit number)
63199114264717068120…86725586113194721281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.263 × 10⁹⁸(99-digit number)
12639822852943413624…73451172226389442561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.527 × 10⁹⁸(99-digit number)
25279645705886827248…46902344452778885121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.055 × 10⁹⁸(99-digit number)
50559291411773654496…93804688905557770241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.011 × 10⁹⁹(100-digit number)
10111858282354730899…87609377811115540481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.022 × 10⁹⁹(100-digit number)
20223716564709461798…75218755622231080961
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,912,148 XPM·at block #6,833,492 · 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