Block #901,886

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/19/2015, 10:10:29 PM · Difficulty 10.9409 · 5,906,941 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a339fff7723772a5e78695f3e35356a3c3bd0f726e6a3160e8c904b49aa69b0a

Height

#901,886

Difficulty

10.940934

Transactions

9

Size

3.92 KB

Version

2

Bits

0af0e10c

Nonce

589,951,526

Timestamp

1/19/2015, 10:10:29 PM

Confirmations

5,906,941

Merkle Root

37ccf0cfec5f47bd2b30c04aa9e8a2d00e7beb4e2f6b423489a508b6b0db58b5
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.009 × 10⁹⁴(95-digit number)
20096027240822397273…96319713712782602211
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.009 × 10⁹⁴(95-digit number)
20096027240822397273…96319713712782602211
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.019 × 10⁹⁴(95-digit number)
40192054481644794546…92639427425565204421
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.038 × 10⁹⁴(95-digit number)
80384108963289589093…85278854851130408841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.607 × 10⁹⁵(96-digit number)
16076821792657917818…70557709702260817681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.215 × 10⁹⁵(96-digit number)
32153643585315835637…41115419404521635361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.430 × 10⁹⁵(96-digit number)
64307287170631671274…82230838809043270721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.286 × 10⁹⁶(97-digit number)
12861457434126334254…64461677618086541441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.572 × 10⁹⁶(97-digit number)
25722914868252668509…28923355236173082881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.144 × 10⁹⁶(97-digit number)
51445829736505337019…57846710472346165761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.028 × 10⁹⁷(98-digit number)
10289165947301067403…15693420944692331521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.057 × 10⁹⁷(98-digit number)
20578331894602134807…31386841889384663041
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,714,674 XPM·at block #6,808,826 · 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.

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