Block #2,540,871

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/27/2018, 12:29:46 PM · Difficulty 10.9871 · 4,275,479 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bf65f395a3ebee47a962342a180425975b1596bd29407bca7e6ab6d45fadd8ce

Height

#2,540,871

Difficulty

10.987124

Transactions

3

Size

650 B

Version

2

Bits

0afcb42c

Nonce

97,460,450

Timestamp

2/27/2018, 12:29:46 PM

Confirmations

4,275,479

Merkle Root

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

5.590 × 10⁹⁵(96-digit number)
55909077341332274283…06361181673289123839
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
5.590 × 10⁹⁵(96-digit number)
55909077341332274283…06361181673289123839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.118 × 10⁹⁶(97-digit number)
11181815468266454856…12722363346578247679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.236 × 10⁹⁶(97-digit number)
22363630936532909713…25444726693156495359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.472 × 10⁹⁶(97-digit number)
44727261873065819426…50889453386312990719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.945 × 10⁹⁶(97-digit number)
89454523746131638853…01778906772625981439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.789 × 10⁹⁷(98-digit number)
17890904749226327770…03557813545251962879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.578 × 10⁹⁷(98-digit number)
35781809498452655541…07115627090503925759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.156 × 10⁹⁷(98-digit number)
71563618996905311082…14231254181007851519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.431 × 10⁹⁸(99-digit number)
14312723799381062216…28462508362015703039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.862 × 10⁹⁸(99-digit number)
28625447598762124433…56925016724031406079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.725 × 10⁹⁸(99-digit number)
57250895197524248866…13850033448062812159
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,774,925 XPM·at block #6,816,349 · 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