Block #2,655,245

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/10/2018, 12:46:44 AM · Difficulty 11.7083 · 4,176,267 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
57e1b6c85988f4aea686cafa8d75d89f19bf861ba30c42bd34f905f2af6b9942

Height

#2,655,245

Difficulty

11.708299

Transactions

7

Size

1.85 KB

Version

2

Bits

0bb55315

Nonce

776,565,492

Timestamp

5/10/2018, 12:46:44 AM

Confirmations

4,176,267

Merkle Root

ed0b05ff8ebfc515b7791aba8d4f265a2d476b0dd1108a2a72d3d6ee9d20ef61
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.631 × 10⁹³(94-digit number)
26316330826028594540…68395468205674931799
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.631 × 10⁹³(94-digit number)
26316330826028594540…68395468205674931799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.263 × 10⁹³(94-digit number)
52632661652057189080…36790936411349863599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.052 × 10⁹⁴(95-digit number)
10526532330411437816…73581872822699727199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.105 × 10⁹⁴(95-digit number)
21053064660822875632…47163745645399454399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.210 × 10⁹⁴(95-digit number)
42106129321645751264…94327491290798908799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.421 × 10⁹⁴(95-digit number)
84212258643291502528…88654982581597817599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.684 × 10⁹⁵(96-digit number)
16842451728658300505…77309965163195635199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.368 × 10⁹⁵(96-digit number)
33684903457316601011…54619930326391270399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.736 × 10⁹⁵(96-digit number)
67369806914633202022…09239860652782540799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.347 × 10⁹⁶(97-digit number)
13473961382926640404…18479721305565081599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.694 × 10⁹⁶(97-digit number)
26947922765853280809…36959442611130163199
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,896,184 XPM·at block #6,831,511 · 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