Block #2,190,943

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/3/2017, 10:47:59 AM · Difficulty 10.9501 · 4,635,465 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
55eac7581ea2efcf6ccd65f80bc4ac275dcb007c44fcd15adf75b66030679036

Height

#2,190,943

Difficulty

10.950140

Transactions

3

Size

945 B

Version

2

Bits

0af33c64

Nonce

1,175,886,613

Timestamp

7/3/2017, 10:47:59 AM

Confirmations

4,635,465

Merkle Root

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

4.343 × 10⁹³(94-digit number)
43431966425826618327…98618922309603581441
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
4.343 × 10⁹³(94-digit number)
43431966425826618327…98618922309603581441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.686 × 10⁹³(94-digit number)
86863932851653236655…97237844619207162881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.737 × 10⁹⁴(95-digit number)
17372786570330647331…94475689238414325761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.474 × 10⁹⁴(95-digit number)
34745573140661294662…88951378476828651521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.949 × 10⁹⁴(95-digit number)
69491146281322589324…77902756953657303041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.389 × 10⁹⁵(96-digit number)
13898229256264517864…55805513907314606081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.779 × 10⁹⁵(96-digit number)
27796458512529035729…11611027814629212161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.559 × 10⁹⁵(96-digit number)
55592917025058071459…23222055629258424321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.111 × 10⁹⁶(97-digit number)
11118583405011614291…46444111258516848641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.223 × 10⁹⁶(97-digit number)
22237166810023228583…92888222517033697281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.447 × 10⁹⁶(97-digit number)
44474333620046457167…85776445034067394561
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,855,396 XPM·at block #6,826,407 · 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