Block #2,672,774

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/22/2018, 8:55:57 AM · Difficulty 11.6947 · 4,169,836 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ea2727a01594c35d8f76e5b6f0eb364c4f57ba462567570dfd542fce0fbae232

Height

#2,672,774

Difficulty

11.694686

Transactions

40

Size

12.92 KB

Version

2

Bits

0bb1d6ef

Nonce

291,219,819

Timestamp

5/22/2018, 8:55:57 AM

Confirmations

4,169,836

Merkle Root

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

9.982 × 10⁹³(94-digit number)
99828860829831678203…85543680020873966099
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
9.982 × 10⁹³(94-digit number)
99828860829831678203…85543680020873966099
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.996 × 10⁹⁴(95-digit number)
19965772165966335640…71087360041747932199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.993 × 10⁹⁴(95-digit number)
39931544331932671281…42174720083495864399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.986 × 10⁹⁴(95-digit number)
79863088663865342562…84349440166991728799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.597 × 10⁹⁵(96-digit number)
15972617732773068512…68698880333983457599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.194 × 10⁹⁵(96-digit number)
31945235465546137025…37397760667966915199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.389 × 10⁹⁵(96-digit number)
63890470931092274050…74795521335933830399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.277 × 10⁹⁶(97-digit number)
12778094186218454810…49591042671867660799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.555 × 10⁹⁶(97-digit number)
25556188372436909620…99182085343735321599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.111 × 10⁹⁶(97-digit number)
51112376744873819240…98364170687470643199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.022 × 10⁹⁷(98-digit number)
10222475348974763848…96728341374941286399
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,985,310 XPM·at block #6,842,609 · 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