Block #2,303,912

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/21/2017, 8:05:02 PM · Difficulty 10.9190 · 4,534,504 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
70c783c999efda200a14b8d1cd064c8b8657c5fbf17af016143bd306b2ab4fa9

Height

#2,303,912

Difficulty

10.919013

Transactions

3

Size

2.05 KB

Version

2

Bits

0aeb4473

Nonce

777,998,772

Timestamp

9/21/2017, 8:05:02 PM

Confirmations

4,534,504

Merkle Root

a26b063fe8f9c6ff7ade5ee757aa248bbf775b598a6ad01272504be2787196be
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.388 × 10⁹⁴(95-digit number)
13880087178391539283…62990426562537686121
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.388 × 10⁹⁴(95-digit number)
13880087178391539283…62990426562537686121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.776 × 10⁹⁴(95-digit number)
27760174356783078567…25980853125075372241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.552 × 10⁹⁴(95-digit number)
55520348713566157135…51961706250150744481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.110 × 10⁹⁵(96-digit number)
11104069742713231427…03923412500301488961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.220 × 10⁹⁵(96-digit number)
22208139485426462854…07846825000602977921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.441 × 10⁹⁵(96-digit number)
44416278970852925708…15693650001205955841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.883 × 10⁹⁵(96-digit number)
88832557941705851416…31387300002411911681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.776 × 10⁹⁶(97-digit number)
17766511588341170283…62774600004823823361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.553 × 10⁹⁶(97-digit number)
35533023176682340566…25549200009647646721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.106 × 10⁹⁶(97-digit number)
71066046353364681133…51098400019295293441
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,951,601 XPM·at block #6,838,415 · 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