Block #2,718,843

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/24/2018, 4:52:52 AM · Difficulty 11.6137 · 4,123,340 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
03f67327b98567697c7eb00dea85f8dd663745142cd06e3cf5f8f563df6dac8d

Height

#2,718,843

Difficulty

11.613749

Transactions

3

Size

947 B

Version

2

Bits

0b9d1ea7

Nonce

46,378,365

Timestamp

6/24/2018, 4:52:52 AM

Confirmations

4,123,340

Merkle Root

6e497f449c284c035c257d833721b03cbbfd8c111fec857196c344f15e6ca8eb
Transactions (3)
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.

7.749 × 10⁹⁶(97-digit number)
77492433577500579883…35910231261497420799
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
7.749 × 10⁹⁶(97-digit number)
77492433577500579883…35910231261497420799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.549 × 10⁹⁷(98-digit number)
15498486715500115976…71820462522994841599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.099 × 10⁹⁷(98-digit number)
30996973431000231953…43640925045989683199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.199 × 10⁹⁷(98-digit number)
61993946862000463907…87281850091979366399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.239 × 10⁹⁸(99-digit number)
12398789372400092781…74563700183958732799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.479 × 10⁹⁸(99-digit number)
24797578744800185562…49127400367917465599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.959 × 10⁹⁸(99-digit number)
49595157489600371125…98254800735834931199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.919 × 10⁹⁸(99-digit number)
99190314979200742251…96509601471669862399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.983 × 10⁹⁹(100-digit number)
19838062995840148450…93019202943339724799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.967 × 10⁹⁹(100-digit number)
39676125991680296900…86038405886679449599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.935 × 10⁹⁹(100-digit number)
79352251983360593801…72076811773358899199
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,981,856 XPM·at block #6,842,182 · 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