Block #2,099,855

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/4/2017, 7:34:07 PM · Difficulty 10.8552 · 4,740,482 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e554ea99e2cb2072fa30665cef56780da1fde710ab3cb666f75f9388701e0355

Height

#2,099,855

Difficulty

10.855156

Transactions

2

Size

425 B

Version

2

Bits

0adaeb88

Nonce

1,479,146,330

Timestamp

5/4/2017, 7:34:07 PM

Confirmations

4,740,482

Merkle Root

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

6.050 × 10⁹⁴(95-digit number)
60504807048156940881…12992884388016204081
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
6.050 × 10⁹⁴(95-digit number)
60504807048156940881…12992884388016204081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.210 × 10⁹⁵(96-digit number)
12100961409631388176…25985768776032408161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.420 × 10⁹⁵(96-digit number)
24201922819262776352…51971537552064816321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.840 × 10⁹⁵(96-digit number)
48403845638525552705…03943075104129632641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.680 × 10⁹⁵(96-digit number)
96807691277051105410…07886150208259265281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.936 × 10⁹⁶(97-digit number)
19361538255410221082…15772300416518530561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.872 × 10⁹⁶(97-digit number)
38723076510820442164…31544600833037061121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.744 × 10⁹⁶(97-digit number)
77446153021640884328…63089201666074122241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.548 × 10⁹⁷(98-digit number)
15489230604328176865…26178403332148244481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.097 × 10⁹⁷(98-digit number)
30978461208656353731…52356806664296488961
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,017 XPM·at block #6,840,336 · 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