Block #2,703,489

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/13/2018, 9:37:07 AM · Difficulty 11.6284 · 4,129,153 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9d0c32052c852bba35c11bc9572650ded8c8f9c81568a336de93765e3a3e23d7

Height

#2,703,489

Difficulty

11.628381

Transactions

5

Size

1.52 KB

Version

2

Bits

0ba0dd99

Nonce

109,278,938

Timestamp

6/13/2018, 9:37:07 AM

Confirmations

4,129,153

Merkle Root

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

3.598 × 10⁹²(93-digit number)
35988640807551166623…76153772029027671881
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
3.598 × 10⁹²(93-digit number)
35988640807551166623…76153772029027671881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.197 × 10⁹²(93-digit number)
71977281615102333246…52307544058055343761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.439 × 10⁹³(94-digit number)
14395456323020466649…04615088116110687521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.879 × 10⁹³(94-digit number)
28790912646040933298…09230176232221375041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.758 × 10⁹³(94-digit number)
57581825292081866597…18460352464442750081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.151 × 10⁹⁴(95-digit number)
11516365058416373319…36920704928885500161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.303 × 10⁹⁴(95-digit number)
23032730116832746638…73841409857771000321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.606 × 10⁹⁴(95-digit number)
46065460233665493277…47682819715542000641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.213 × 10⁹⁴(95-digit number)
92130920467330986555…95365639431084001281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.842 × 10⁹⁵(96-digit number)
18426184093466197311…90731278862168002561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.685 × 10⁹⁵(96-digit number)
36852368186932394622…81462557724336005121
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,286 XPM·at block #6,832,641 · 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