Block #2,149,738

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/7/2017, 6:31:23 AM · Difficulty 10.8983 · 4,656,961 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
32fa248718efac664f8da4c54954c424456374a20adf076b52d88772d6c35ff6

Height

#2,149,738

Difficulty

10.898341

Transactions

19

Size

5.97 KB

Version

2

Bits

0ae5f9a6

Nonce

177,408,954

Timestamp

6/7/2017, 6:31:23 AM

Confirmations

4,656,961

Merkle Root

7861433933af9b036cf2d2104ab5d03837b03f7a9e52da2a089bc5041f670f3b
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.

9.055 × 10⁹⁵(96-digit number)
90559462371204480640…78043943889934400001
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
9.055 × 10⁹⁵(96-digit number)
90559462371204480640…78043943889934400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.811 × 10⁹⁶(97-digit number)
18111892474240896128…56087887779868800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.622 × 10⁹⁶(97-digit number)
36223784948481792256…12175775559737600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.244 × 10⁹⁶(97-digit number)
72447569896963584512…24351551119475200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.448 × 10⁹⁷(98-digit number)
14489513979392716902…48703102238950400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.897 × 10⁹⁷(98-digit number)
28979027958785433804…97406204477900800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.795 × 10⁹⁷(98-digit number)
57958055917570867609…94812408955801600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.159 × 10⁹⁸(99-digit number)
11591611183514173521…89624817911603200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.318 × 10⁹⁸(99-digit number)
23183222367028347043…79249635823206400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.636 × 10⁹⁸(99-digit number)
46366444734056694087…58499271646412800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.273 × 10⁹⁸(99-digit number)
92732889468113388175…16998543292825600001
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,697,688 XPM·at block #6,806,698 · 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