Block #1,902,000

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/19/2016, 4:37:26 PM · Difficulty 10.7828 · 4,929,511 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7ca220b10420f2d0fe77de5c21fd50a2c2c773f29fbacaa0bfc94acf2dfe2736

Height

#1,902,000

Difficulty

10.782753

Transactions

2

Size

2.73 KB

Version

2

Bits

0ac86278

Nonce

414,361,155

Timestamp

12/19/2016, 4:37:26 PM

Confirmations

4,929,511

Merkle Root

d551bdc0c8ba1da19a433b807564695e8db5f527977961a35da69ceb3f6d5b10
Transactions (2)
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.226 × 10⁹⁶(97-digit number)
32264024995633398940…08388403766081852161
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.226 × 10⁹⁶(97-digit number)
32264024995633398940…08388403766081852161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.452 × 10⁹⁶(97-digit number)
64528049991266797880…16776807532163704321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.290 × 10⁹⁷(98-digit number)
12905609998253359576…33553615064327408641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.581 × 10⁹⁷(98-digit number)
25811219996506719152…67107230128654817281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.162 × 10⁹⁷(98-digit number)
51622439993013438304…34214460257309634561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.032 × 10⁹⁸(99-digit number)
10324487998602687660…68428920514619269121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.064 × 10⁹⁸(99-digit number)
20648975997205375321…36857841029238538241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.129 × 10⁹⁸(99-digit number)
41297951994410750643…73715682058477076481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.259 × 10⁹⁸(99-digit number)
82595903988821501286…47431364116954152961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.651 × 10⁹⁹(100-digit number)
16519180797764300257…94862728233908305921
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,896,176 XPM·at block #6,831,510 · 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