Block #2,653,576

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/8/2018, 12:34:27 PM · Difficulty 11.7359 · 4,182,964 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
af65e5011dcc096d536745a61fc177ecbe7475b44da21d992a2f63a2327acca5

Height

#2,653,576

Difficulty

11.735903

Transactions

2

Size

875 B

Version

2

Bits

0bbc641e

Nonce

994,689,602

Timestamp

5/8/2018, 12:34:27 PM

Confirmations

4,182,964

Merkle Root

7bd41ac5cc148b35635d39cf2b391f99ff34921444161b7da31269437a55423c
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.

4.901 × 10⁹⁶(97-digit number)
49018340099411853037…38740659480429030399
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
4.901 × 10⁹⁶(97-digit number)
49018340099411853037…38740659480429030399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.803 × 10⁹⁶(97-digit number)
98036680198823706074…77481318960858060799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.960 × 10⁹⁷(98-digit number)
19607336039764741214…54962637921716121599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.921 × 10⁹⁷(98-digit number)
39214672079529482429…09925275843432243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.842 × 10⁹⁷(98-digit number)
78429344159058964859…19850551686864486399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.568 × 10⁹⁸(99-digit number)
15685868831811792971…39701103373728972799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.137 × 10⁹⁸(99-digit number)
31371737663623585943…79402206747457945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.274 × 10⁹⁸(99-digit number)
62743475327247171887…58804413494915891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.254 × 10⁹⁹(100-digit number)
12548695065449434377…17608826989831782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.509 × 10⁹⁹(100-digit number)
25097390130898868755…35217653979663564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.019 × 10⁹⁹(100-digit number)
50194780261797737510…70435307959327129599
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,936,584 XPM·at block #6,836,539 · 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