Block #2,107,043

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/8/2017, 6:31:39 PM · Difficulty 10.8924 · 4,733,984 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
083f9ca74ea012ff685630737dc5698da27183c5f4f8f736f36fd990a0aa0dbe

Height

#2,107,043

Difficulty

10.892444

Transactions

3

Size

653 B

Version

2

Bits

0ae4772e

Nonce

328,475,735

Timestamp

5/8/2017, 6:31:39 PM

Confirmations

4,733,984

Merkle Root

65bde962ebe2ae437ffa025a3572efa0f15232e70972052f361af3d02d7985e1
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.

4.806 × 10⁹⁴(95-digit number)
48068926634041165049…55472261817418628001
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
4.806 × 10⁹⁴(95-digit number)
48068926634041165049…55472261817418628001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.613 × 10⁹⁴(95-digit number)
96137853268082330099…10944523634837256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.922 × 10⁹⁵(96-digit number)
19227570653616466019…21889047269674512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.845 × 10⁹⁵(96-digit number)
38455141307232932039…43778094539349024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.691 × 10⁹⁵(96-digit number)
76910282614465864079…87556189078698048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.538 × 10⁹⁶(97-digit number)
15382056522893172815…75112378157396096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.076 × 10⁹⁶(97-digit number)
30764113045786345631…50224756314792192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.152 × 10⁹⁶(97-digit number)
61528226091572691263…00449512629584384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.230 × 10⁹⁷(98-digit number)
12305645218314538252…00899025259168768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.461 × 10⁹⁷(98-digit number)
24611290436629076505…01798050518337536001
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,972,574 XPM·at block #6,841,026 · 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