Block #2,285,119

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/6/2017, 3:56:40 PM · Difficulty 10.9553 · 4,547,553 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1a958fa1f6359db1d29e46670ac21c8f47f0b9f835731a4ad340ee4727c50010

Height

#2,285,119

Difficulty

10.955305

Transactions

2

Size

2.44 KB

Version

2

Bits

0af48ee2

Nonce

731,254,047

Timestamp

9/6/2017, 3:56:40 PM

Confirmations

4,547,553

Merkle Root

e9d1a18708202fa61919a65adfbc4e027a6f6dce10fe2d42d343581829bc4d80
Transactions (2)
1 in → 1 out8.3500 XPM110 B
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.091 × 10⁹⁴(95-digit number)
90919217141424628879…14152201514543731201
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.091 × 10⁹⁴(95-digit number)
90919217141424628879…14152201514543731201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.818 × 10⁹⁵(96-digit number)
18183843428284925775…28304403029087462401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.636 × 10⁹⁵(96-digit number)
36367686856569851551…56608806058174924801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.273 × 10⁹⁵(96-digit number)
72735373713139703103…13217612116349849601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.454 × 10⁹⁶(97-digit number)
14547074742627940620…26435224232699699201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.909 × 10⁹⁶(97-digit number)
29094149485255881241…52870448465399398401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.818 × 10⁹⁶(97-digit number)
58188298970511762483…05740896930798796801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.163 × 10⁹⁷(98-digit number)
11637659794102352496…11481793861597593601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.327 × 10⁹⁷(98-digit number)
23275319588204704993…22963587723195187201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.655 × 10⁹⁷(98-digit number)
46550639176409409986…45927175446390374401
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,905,528 XPM·at block #6,832,671 · 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