Block #2,089,106

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/26/2017, 7:37:24 PM · Difficulty 10.8753 · 4,751,230 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d3f35305970f7e3e5e47d81d626b33baf250120fcd192f45a1dbaa448e4d869f

Height

#2,089,106

Difficulty

10.875296

Transactions

2

Size

426 B

Version

2

Bits

0ae0136b

Nonce

229,948,731

Timestamp

4/26/2017, 7:37:24 PM

Confirmations

4,751,230

Merkle Root

9ef36ddf403288e4d86443576bd3aabcfbf8381a93db05974531c4f11e4ab246
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.

1.495 × 10⁹⁷(98-digit number)
14951829122449750417…92318241616206458881
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.495 × 10⁹⁷(98-digit number)
14951829122449750417…92318241616206458881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.990 × 10⁹⁷(98-digit number)
29903658244899500835…84636483232412917761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.980 × 10⁹⁷(98-digit number)
59807316489799001670…69272966464825835521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.196 × 10⁹⁸(99-digit number)
11961463297959800334…38545932929651671041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.392 × 10⁹⁸(99-digit number)
23922926595919600668…77091865859303342081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.784 × 10⁹⁸(99-digit number)
47845853191839201336…54183731718606684161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.569 × 10⁹⁸(99-digit number)
95691706383678402672…08367463437213368321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.913 × 10⁹⁹(100-digit number)
19138341276735680534…16734926874426736641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.827 × 10⁹⁹(100-digit number)
38276682553471361069…33469853748853473281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.655 × 10⁹⁹(100-digit number)
76553365106942722138…66939707497706946561
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,967,009 XPM·at block #6,840,335 · 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