Block #2,655,077

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/9/2018, 9:23:27 PM · Difficulty 11.7103 · 4,183,024 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6485124ce02fdcd2bb719d8704a6f7babb0f4f217891bbcb42d6ca984afabf62

Height

#2,655,077

Difficulty

11.710288

Transactions

2

Size

1.14 KB

Version

2

Bits

0bb5d56b

Nonce

1,759,835,834

Timestamp

5/9/2018, 9:23:27 PM

Confirmations

4,183,024

Merkle Root

79018eacc4070575e51953a68b087f91c9a86e0a46c729491925b51dc8a29232
Transactions (2)
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.226 × 10⁹⁴(95-digit number)
72262453612715282879…25827149343123914719
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.226 × 10⁹⁴(95-digit number)
72262453612715282879…25827149343123914719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.445 × 10⁹⁵(96-digit number)
14452490722543056575…51654298686247829439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.890 × 10⁹⁵(96-digit number)
28904981445086113151…03308597372495658879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.780 × 10⁹⁵(96-digit number)
57809962890172226303…06617194744991317759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.156 × 10⁹⁶(97-digit number)
11561992578034445260…13234389489982635519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.312 × 10⁹⁶(97-digit number)
23123985156068890521…26468778979965271039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.624 × 10⁹⁶(97-digit number)
46247970312137781042…52937557959930542079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.249 × 10⁹⁶(97-digit number)
92495940624275562085…05875115919861084159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.849 × 10⁹⁷(98-digit number)
18499188124855112417…11750231839722168319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.699 × 10⁹⁷(98-digit number)
36998376249710224834…23500463679444336639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.399 × 10⁹⁷(98-digit number)
73996752499420449668…47000927358888673279
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,949,161 XPM·at block #6,838,100 · 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