Block #2,651,503

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/6/2018, 8:56:49 PM · Difficulty 11.7514 · 4,187,507 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1e14fd947aa4a791d25f250e590ee9723ea45d8bd87f33bf63035c3f2151a274

Height

#2,651,503

Difficulty

11.751374

Transactions

2

Size

869 B

Version

2

Bits

0bc05a08

Nonce

697,972,936

Timestamp

5/6/2018, 8:56:49 PM

Confirmations

4,187,507

Merkle Root

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

2.824 × 10⁹⁶(97-digit number)
28246948298221147771…87833480004287433599
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.824 × 10⁹⁶(97-digit number)
28246948298221147771…87833480004287433599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.649 × 10⁹⁶(97-digit number)
56493896596442295542…75666960008574867199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.129 × 10⁹⁷(98-digit number)
11298779319288459108…51333920017149734399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.259 × 10⁹⁷(98-digit number)
22597558638576918216…02667840034299468799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.519 × 10⁹⁷(98-digit number)
45195117277153836433…05335680068598937599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.039 × 10⁹⁷(98-digit number)
90390234554307672867…10671360137197875199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.807 × 10⁹⁸(99-digit number)
18078046910861534573…21342720274395750399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.615 × 10⁹⁸(99-digit number)
36156093821723069147…42685440548791500799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.231 × 10⁹⁸(99-digit number)
72312187643446138294…85370881097583001599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.446 × 10⁹⁹(100-digit number)
14462437528689227658…70741762195166003199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.892 × 10⁹⁹(100-digit number)
28924875057378455317…41483524390332006399
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,956,347 XPM·at block #6,839,009 · 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