Block #2,051,944

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/3/2017, 4:46:04 PM · Difficulty 10.7287 · 4,765,662 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
48b7cdddc5a2b0af15534a3cb4cde4ee4fd875384148238f9298f50669c208a0

Height

#2,051,944

Difficulty

10.728691

Transactions

3

Size

800 B

Version

2

Bits

0aba8b7c

Nonce

21,633,891

Timestamp

4/3/2017, 4:46:04 PM

Confirmations

4,765,662

Merkle Root

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

1.196 × 10⁹⁴(95-digit number)
11963091125699498357…35066815701610542079
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.196 × 10⁹⁴(95-digit number)
11963091125699498357…35066815701610542079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.392 × 10⁹⁴(95-digit number)
23926182251398996714…70133631403221084159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.785 × 10⁹⁴(95-digit number)
47852364502797993429…40267262806442168319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.570 × 10⁹⁴(95-digit number)
95704729005595986858…80534525612884336639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.914 × 10⁹⁵(96-digit number)
19140945801119197371…61069051225768673279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.828 × 10⁹⁵(96-digit number)
38281891602238394743…22138102451537346559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.656 × 10⁹⁵(96-digit number)
76563783204476789486…44276204903074693119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.531 × 10⁹⁶(97-digit number)
15312756640895357897…88552409806149386239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.062 × 10⁹⁶(97-digit number)
30625513281790715794…77104819612298772479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.125 × 10⁹⁶(97-digit number)
61251026563581431589…54209639224597544959
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,784,903 XPM·at block #6,817,605 · 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