Block #2,151,803

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/8/2017, 3:22:05 PM · Difficulty 10.9003 · 4,674,596 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
32b3cf504873ae5e6c188b7ff8856243a78ddf0cf87afc5e2056ea3cacb244ec

Height

#2,151,803

Difficulty

10.900294

Transactions

2

Size

2.01 KB

Version

2

Bits

0ae679ae

Nonce

103,386,682

Timestamp

6/8/2017, 3:22:05 PM

Confirmations

4,674,596

Merkle Root

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

1.969 × 10⁹⁶(97-digit number)
19697579763733747791…20281816910394327041
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.969 × 10⁹⁶(97-digit number)
19697579763733747791…20281816910394327041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.939 × 10⁹⁶(97-digit number)
39395159527467495582…40563633820788654081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.879 × 10⁹⁶(97-digit number)
78790319054934991165…81127267641577308161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.575 × 10⁹⁷(98-digit number)
15758063810986998233…62254535283154616321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.151 × 10⁹⁷(98-digit number)
31516127621973996466…24509070566309232641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.303 × 10⁹⁷(98-digit number)
63032255243947992932…49018141132618465281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.260 × 10⁹⁸(99-digit number)
12606451048789598586…98036282265236930561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.521 × 10⁹⁸(99-digit number)
25212902097579197172…96072564530473861121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.042 × 10⁹⁸(99-digit number)
50425804195158394345…92145129060947722241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.008 × 10⁹⁹(100-digit number)
10085160839031678869…84290258121895444481
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,855,332 XPM·at block #6,826,398 · 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