Block #2,247,988

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/12/2017, 8:14:24 AM · Difficulty 10.9477 · 4,595,318 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
707ed2fe35fda47a508befb45e9a54ceb9b0ce48d365d8a76f23eb6e2118f167

Height

#2,247,988

Difficulty

10.947733

Transactions

2

Size

426 B

Version

2

Bits

0af29e99

Nonce

1,864,793,522

Timestamp

8/12/2017, 8:14:24 AM

Confirmations

4,595,318

Merkle Root

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

5.089 × 10⁹⁴(95-digit number)
50890317159826474008…32660078918414945201
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
5.089 × 10⁹⁴(95-digit number)
50890317159826474008…32660078918414945201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.017 × 10⁹⁵(96-digit number)
10178063431965294801…65320157836829890401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.035 × 10⁹⁵(96-digit number)
20356126863930589603…30640315673659780801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.071 × 10⁹⁵(96-digit number)
40712253727861179206…61280631347319561601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.142 × 10⁹⁵(96-digit number)
81424507455722358413…22561262694639123201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.628 × 10⁹⁶(97-digit number)
16284901491144471682…45122525389278246401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.256 × 10⁹⁶(97-digit number)
32569802982288943365…90245050778556492801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.513 × 10⁹⁶(97-digit number)
65139605964577886730…80490101557112985601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.302 × 10⁹⁷(98-digit number)
13027921192915577346…60980203114225971201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.605 × 10⁹⁷(98-digit number)
26055842385831154692…21960406228451942401
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,990,814 XPM·at block #6,843,305 · 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