Block #2,854,943

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/25/2018, 7:50:01 PM · Difficulty 11.7048 · 3,990,205 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
eb7ccadba75b2aa710549d4777e05e1f37a3c8b74b55da99c08b3b5596f1a981

Height

#2,854,943

Difficulty

11.704783

Transactions

4

Size

1.16 KB

Version

2

Bits

0bb46cb0

Nonce

1,337,949,159

Timestamp

9/25/2018, 7:50:01 PM

Confirmations

3,990,205

Merkle Root

781e5e872d03974fd06741f788c9bd5ac34cd944a7df77bbc56eaf38a70febca
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.

2.867 × 10⁹⁶(97-digit number)
28677169653793597128…45880856183546280959
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
2.867 × 10⁹⁶(97-digit number)
28677169653793597128…45880856183546280959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.735 × 10⁹⁶(97-digit number)
57354339307587194256…91761712367092561919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.147 × 10⁹⁷(98-digit number)
11470867861517438851…83523424734185123839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.294 × 10⁹⁷(98-digit number)
22941735723034877702…67046849468370247679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.588 × 10⁹⁷(98-digit number)
45883471446069755405…34093698936740495359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.176 × 10⁹⁷(98-digit number)
91766942892139510810…68187397873480990719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.835 × 10⁹⁸(99-digit number)
18353388578427902162…36374795746961981439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.670 × 10⁹⁸(99-digit number)
36706777156855804324…72749591493923962879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.341 × 10⁹⁸(99-digit number)
73413554313711608648…45499182987847925759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.468 × 10⁹⁹(100-digit number)
14682710862742321729…90998365975695851519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.936 × 10⁹⁹(100-digit number)
29365421725484643459…81996731951391703039
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:58,005,611 XPM·at block #6,845,147 · 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