Block #2,948,666

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/2/2018, 10:09:20 AM · Difficulty 11.3999 · 3,884,657 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
734f18ae442ed2e77a1c5080b00de770ca7187086559417e6f9338fa9791e858

Height

#2,948,666

Difficulty

11.399852

Transactions

35

Size

10.52 KB

Version

2

Bits

0b665cb3

Nonce

1,863,124,899

Timestamp

12/2/2018, 10:09:20 AM

Confirmations

3,884,657

Merkle Root

04921fbf25d85278a14368f3978951ce8138c4ff8b1fc743c9857d6cae8ea31e
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.

1.755 × 10⁹⁵(96-digit number)
17553037960693523321…30876164471699975759
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
1.755 × 10⁹⁵(96-digit number)
17553037960693523321…30876164471699975759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.510 × 10⁹⁵(96-digit number)
35106075921387046643…61752328943399951519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.021 × 10⁹⁵(96-digit number)
70212151842774093287…23504657886799903039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.404 × 10⁹⁶(97-digit number)
14042430368554818657…47009315773599806079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.808 × 10⁹⁶(97-digit number)
28084860737109637315…94018631547199612159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.616 × 10⁹⁶(97-digit number)
56169721474219274630…88037263094399224319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.123 × 10⁹⁷(98-digit number)
11233944294843854926…76074526188798448639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.246 × 10⁹⁷(98-digit number)
22467888589687709852…52149052377596897279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.493 × 10⁹⁷(98-digit number)
44935777179375419704…04298104755193794559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.987 × 10⁹⁷(98-digit number)
89871554358750839408…08596209510387589119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.797 × 10⁹⁸(99-digit number)
17974310871750167881…17192419020775178239
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,910,777 XPM·at block #6,833,322 · 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