Block #2,135,861

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/28/2017, 3:00:26 PM · Difficulty 10.8982 · 4,707,063 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2265be684ba87ac83c9d2af2a2107a8bb35d04c67a77ebe9c9475e48b9ab21e5

Height

#2,135,861

Difficulty

10.898219

Transactions

9

Size

5.42 KB

Version

2

Bits

0ae5f1b4

Nonce

2,016,841,381

Timestamp

5/28/2017, 3:00:26 PM

Confirmations

4,707,063

Merkle Root

938777e2e1c58e50393bf6ec61c56a71002e26aff8c1861d9feef74624b4bf58
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.534 × 10⁹⁴(95-digit number)
15348414932752672628…48618804779681486719
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.534 × 10⁹⁴(95-digit number)
15348414932752672628…48618804779681486719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.069 × 10⁹⁴(95-digit number)
30696829865505345256…97237609559362973439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.139 × 10⁹⁴(95-digit number)
61393659731010690512…94475219118725946879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.227 × 10⁹⁵(96-digit number)
12278731946202138102…88950438237451893759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.455 × 10⁹⁵(96-digit number)
24557463892404276204…77900876474903787519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.911 × 10⁹⁵(96-digit number)
49114927784808552409…55801752949807575039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.822 × 10⁹⁵(96-digit number)
98229855569617104819…11603505899615150079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.964 × 10⁹⁶(97-digit number)
19645971113923420963…23207011799230300159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.929 × 10⁹⁶(97-digit number)
39291942227846841927…46414023598460600319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.858 × 10⁹⁶(97-digit number)
78583884455693683855…92828047196921200639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.571 × 10⁹⁷(98-digit number)
15716776891138736771…85656094393842401279
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,987,740 XPM·at block #6,842,923 · 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