Block #1,897,162

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2016, 7:06:27 PM · Difficulty 10.7518 · 4,935,790 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c875adc356a2ffb08ff9e5673812653c530ba9b4fec952661141c9872ea2548a

Height

#1,897,162

Difficulty

10.751832

Transactions

2

Size

2.52 KB

Version

2

Bits

0ac0780a

Nonce

652,024,651

Timestamp

12/16/2016, 7:06:27 PM

Confirmations

4,935,790

Merkle Root

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

1.305 × 10⁹⁴(95-digit number)
13056413410121276878…28157888235329795101
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
1.305 × 10⁹⁴(95-digit number)
13056413410121276878…28157888235329795101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.611 × 10⁹⁴(95-digit number)
26112826820242553757…56315776470659590201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.222 × 10⁹⁴(95-digit number)
52225653640485107514…12631552941319180401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.044 × 10⁹⁵(96-digit number)
10445130728097021502…25263105882638360801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.089 × 10⁹⁵(96-digit number)
20890261456194043005…50526211765276721601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.178 × 10⁹⁵(96-digit number)
41780522912388086011…01052423530553443201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.356 × 10⁹⁵(96-digit number)
83561045824776172022…02104847061106886401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.671 × 10⁹⁶(97-digit number)
16712209164955234404…04209694122213772801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.342 × 10⁹⁶(97-digit number)
33424418329910468809…08419388244427545601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.684 × 10⁹⁶(97-digit number)
66848836659820937618…16838776488855091201
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,907,796 XPM·at block #6,832,951 · 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