Block #2,836,715

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/13/2018, 12:18:17 AM · Difficulty 11.7171 · 3,996,867 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
50965dfd789fec65732c1f5736c3c0a6ef776dce947e1100d623fdf039a1dd32

Height

#2,836,715

Difficulty

11.717069

Transactions

42

Size

11.29 KB

Version

2

Bits

0bb791d6

Nonce

796,116,806

Timestamp

9/13/2018, 12:18:17 AM

Confirmations

3,996,867

Merkle Root

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

6.313 × 10⁹⁴(95-digit number)
63130405790821576880…72444026178025349921
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
6.313 × 10⁹⁴(95-digit number)
63130405790821576880…72444026178025349921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.262 × 10⁹⁵(96-digit number)
12626081158164315376…44888052356050699841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.525 × 10⁹⁵(96-digit number)
25252162316328630752…89776104712101399681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.050 × 10⁹⁵(96-digit number)
50504324632657261504…79552209424202799361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.010 × 10⁹⁶(97-digit number)
10100864926531452300…59104418848405598721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.020 × 10⁹⁶(97-digit number)
20201729853062904601…18208837696811197441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.040 × 10⁹⁶(97-digit number)
40403459706125809203…36417675393622394881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.080 × 10⁹⁶(97-digit number)
80806919412251618407…72835350787244789761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.616 × 10⁹⁷(98-digit number)
16161383882450323681…45670701574489579521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.232 × 10⁹⁷(98-digit number)
32322767764900647363…91341403148979159041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.464 × 10⁹⁷(98-digit number)
64645535529801294726…82682806297958318081
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,912,861 XPM·at block #6,833,581 · 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