Block #2,718,514

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/23/2018, 11:03:09 PM · Difficulty 11.6153 · 4,121,212 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bc605383bd23060326c207ecae4465e4ef831b5462bddb3e442fa17e59b03cc7

Height

#2,718,514

Difficulty

11.615274

Transactions

33

Size

9.69 KB

Version

2

Bits

0b9d829b

Nonce

182,737,519

Timestamp

6/23/2018, 11:03:09 PM

Confirmations

4,121,212

Merkle Root

465b388f09d5ec66b0e7139bd6715a1b97d2670d9eb68ee47707153899fb5c82
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.429 × 10⁹⁴(95-digit number)
24291684463463537276…23269171249190902319
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.429 × 10⁹⁴(95-digit number)
24291684463463537276…23269171249190902319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.858 × 10⁹⁴(95-digit number)
48583368926927074552…46538342498381804639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.716 × 10⁹⁴(95-digit number)
97166737853854149104…93076684996763609279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.943 × 10⁹⁵(96-digit number)
19433347570770829820…86153369993527218559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.886 × 10⁹⁵(96-digit number)
38866695141541659641…72306739987054437119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.773 × 10⁹⁵(96-digit number)
77733390283083319283…44613479974108874239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.554 × 10⁹⁶(97-digit number)
15546678056616663856…89226959948217748479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.109 × 10⁹⁶(97-digit number)
31093356113233327713…78453919896435496959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.218 × 10⁹⁶(97-digit number)
62186712226466655426…56907839792870993919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.243 × 10⁹⁷(98-digit number)
12437342445293331085…13815679585741987839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.487 × 10⁹⁷(98-digit number)
24874684890586662170…27631359171483975679
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,962,092 XPM·at block #6,839,725 · 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