Block #1,718,103

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/15/2016, 9:36:19 AM · Difficulty 10.6657 · 5,112,466 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
48a3efab88873382542f41b3dc6b6e14bba7c7f87518a6cf6dc6a192e11a5cfc

Height

#1,718,103

Difficulty

10.665726

Transactions

4

Size

3.60 KB

Version

2

Bits

0aaa6d05

Nonce

1,859,375,435

Timestamp

8/15/2016, 9:36:19 AM

Confirmations

5,112,466

Merkle Root

c3787ce56e12b422cccb8009add7ecd91be47d363da866e232fd119f493303bb
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.035 × 10⁹²(93-digit number)
60355188246507921777…81714177567670188801
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.035 × 10⁹²(93-digit number)
60355188246507921777…81714177567670188801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.207 × 10⁹³(94-digit number)
12071037649301584355…63428355135340377601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.414 × 10⁹³(94-digit number)
24142075298603168711…26856710270680755201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.828 × 10⁹³(94-digit number)
48284150597206337422…53713420541361510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.656 × 10⁹³(94-digit number)
96568301194412674844…07426841082723020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.931 × 10⁹⁴(95-digit number)
19313660238882534968…14853682165446041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.862 × 10⁹⁴(95-digit number)
38627320477765069937…29707364330892083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.725 × 10⁹⁴(95-digit number)
77254640955530139875…59414728661784166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.545 × 10⁹⁵(96-digit number)
15450928191106027975…18829457323568332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.090 × 10⁹⁵(96-digit number)
30901856382212055950…37658914647136665601
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,888,680 XPM·at block #6,830,568 · 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