Block #2,561,845

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/12/2018, 9:20:57 AM · Difficulty 10.9925 · 4,272,071 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9ef6faa82f2495571cc2a0d7cd050c2b0c26e2045905392c5dc749b851dcf2d1

Height

#2,561,845

Difficulty

10.992542

Transactions

4

Size

1.56 KB

Version

2

Bits

0afe1741

Nonce

227,414,934

Timestamp

3/12/2018, 9:20:57 AM

Confirmations

4,272,071

Merkle Root

7bae4bf8cd742bdbc9be94b527ba04b17d05ca6d18cd9dae3744bf79b1bd81e0
Transactions (4)
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.

8.477 × 10⁹⁵(96-digit number)
84772955304802384564…85118097226511632639
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
8.477 × 10⁹⁵(96-digit number)
84772955304802384564…85118097226511632639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.695 × 10⁹⁶(97-digit number)
16954591060960476912…70236194453023265279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.390 × 10⁹⁶(97-digit number)
33909182121920953825…40472388906046530559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.781 × 10⁹⁶(97-digit number)
67818364243841907651…80944777812093061119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.356 × 10⁹⁷(98-digit number)
13563672848768381530…61889555624186122239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.712 × 10⁹⁷(98-digit number)
27127345697536763060…23779111248372244479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.425 × 10⁹⁷(98-digit number)
54254691395073526121…47558222496744488959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.085 × 10⁹⁸(99-digit number)
10850938279014705224…95116444993488977919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.170 × 10⁹⁸(99-digit number)
21701876558029410448…90232889986977955839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.340 × 10⁹⁸(99-digit number)
43403753116058820896…80465779973955911679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.680 × 10⁹⁸(99-digit number)
86807506232117641793…60931559947911823359
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,915,554 XPM·at block #6,833,915 · 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