Block #2,836,144

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/12/2018, 3:13:19 PM · Difficulty 11.7155 · 4,002,651 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e8750f5de405b3fadcba337868ea84b19d1b7057e631724e9c404f84ea279657

Height

#2,836,144

Difficulty

11.715541

Transactions

2

Size

426 B

Version

2

Bits

0bb72db1

Nonce

1,839,301,018

Timestamp

9/12/2018, 3:13:19 PM

Confirmations

4,002,651

Merkle Root

24f5627039e82fe6cd46808f70104b1ae7b3806842908a260b052d92fa2fae59
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.

6.626 × 10⁹⁶(97-digit number)
66267159519488488874…64089377452297338881
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.626 × 10⁹⁶(97-digit number)
66267159519488488874…64089377452297338881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.325 × 10⁹⁷(98-digit number)
13253431903897697774…28178754904594677761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.650 × 10⁹⁷(98-digit number)
26506863807795395549…56357509809189355521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.301 × 10⁹⁷(98-digit number)
53013727615590791099…12715019618378711041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.060 × 10⁹⁸(99-digit number)
10602745523118158219…25430039236757422081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.120 × 10⁹⁸(99-digit number)
21205491046236316439…50860078473514844161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.241 × 10⁹⁸(99-digit number)
42410982092472632879…01720156947029688321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.482 × 10⁹⁸(99-digit number)
84821964184945265759…03440313894059376641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.696 × 10⁹⁹(100-digit number)
16964392836989053151…06880627788118753281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.392 × 10⁹⁹(100-digit number)
33928785673978106303…13761255576237506561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.785 × 10⁹⁹(100-digit number)
67857571347956212607…27522511152475013121
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,954,623 XPM·at block #6,838,794 · 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