Block #2,853,015

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/24/2018, 7:50:23 AM · Difficulty 11.7181 · 3,988,075 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3654f30650cd6bce9e6ed532e5be0b8749259a4bf2d798bfa7bddd94aac53082

Height

#2,853,015

Difficulty

11.718080

Transactions

29

Size

9.06 KB

Version

2

Bits

0bb7d416

Nonce

1,822,965,948

Timestamp

9/24/2018, 7:50:23 AM

Confirmations

3,988,075

Merkle Root

8a84c2f3f0c9032be250426a9d7d0714008b7467d7150f14152eadbc75fe0d40
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.611 × 10⁹⁴(95-digit number)
16117288709858650691…68588529160520858601
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.611 × 10⁹⁴(95-digit number)
16117288709858650691…68588529160520858601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.223 × 10⁹⁴(95-digit number)
32234577419717301382…37177058321041717201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.446 × 10⁹⁴(95-digit number)
64469154839434602765…74354116642083434401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.289 × 10⁹⁵(96-digit number)
12893830967886920553…48708233284166868801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.578 × 10⁹⁵(96-digit number)
25787661935773841106…97416466568333737601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.157 × 10⁹⁵(96-digit number)
51575323871547682212…94832933136667475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.031 × 10⁹⁶(97-digit number)
10315064774309536442…89665866273334950401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.063 × 10⁹⁶(97-digit number)
20630129548619072884…79331732546669900801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.126 × 10⁹⁶(97-digit number)
41260259097238145769…58663465093339801601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.252 × 10⁹⁶(97-digit number)
82520518194476291539…17326930186679603201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.650 × 10⁹⁷(98-digit number)
16504103638895258307…34653860373359206401
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,973,084 XPM·at block #6,841,089 · 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