Block #2,850,471

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/22/2018, 10:04:34 AM · Difficulty 11.7292 · 3,980,659 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c2ff8b23ab5c428af789b4572bb64bc2668db85a0b64d629a97680bcf4383d79

Height

#2,850,471

Difficulty

11.729161

Transactions

13

Size

3.78 KB

Version

2

Bits

0bbaaa46

Nonce

209,190,110

Timestamp

9/22/2018, 10:04:34 AM

Confirmations

3,980,659

Merkle Root

515472a1482f84203d6486199b4a0cafc8ac8540492be64ae697a5657f3e7ab5
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.

2.729 × 10⁹⁵(96-digit number)
27297686145734116002…89732939457313525761
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
2.729 × 10⁹⁵(96-digit number)
27297686145734116002…89732939457313525761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.459 × 10⁹⁵(96-digit number)
54595372291468232005…79465878914627051521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.091 × 10⁹⁶(97-digit number)
10919074458293646401…58931757829254103041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.183 × 10⁹⁶(97-digit number)
21838148916587292802…17863515658508206081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.367 × 10⁹⁶(97-digit number)
43676297833174585604…35727031317016412161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.735 × 10⁹⁶(97-digit number)
87352595666349171208…71454062634032824321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.747 × 10⁹⁷(98-digit number)
17470519133269834241…42908125268065648641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.494 × 10⁹⁷(98-digit number)
34941038266539668483…85816250536131297281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.988 × 10⁹⁷(98-digit number)
69882076533079336966…71632501072262594561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.397 × 10⁹⁸(99-digit number)
13976415306615867393…43265002144525189121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.795 × 10⁹⁸(99-digit number)
27952830613231734786…86530004289050378241
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,893,186 XPM·at block #6,831,129 · 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