Block #3,001,076

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/8/2019, 6:52:37 PM · Difficulty 11.2115 · 3,837,939 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
10aa25be45b51a06dafad1bc8060f6a34bbc6fc7fcf4288cb9d73d0046d190df

Height

#3,001,076

Difficulty

11.211503

Transactions

29

Size

7.54 KB

Version

2

Bits

0b362510

Nonce

2,062,078,972

Timestamp

1/8/2019, 6:52:37 PM

Confirmations

3,837,939

Merkle Root

3ff2b61f3394ee6cf7feb37c710391c779a7dac42184d6286e7200b2b316226c
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.283 × 10⁹⁵(96-digit number)
12837828088227581376…70335817442913900799
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.283 × 10⁹⁵(96-digit number)
12837828088227581376…70335817442913900799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.567 × 10⁹⁵(96-digit number)
25675656176455162752…40671634885827801599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.135 × 10⁹⁵(96-digit number)
51351312352910325504…81343269771655603199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.027 × 10⁹⁶(97-digit number)
10270262470582065100…62686539543311206399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.054 × 10⁹⁶(97-digit number)
20540524941164130201…25373079086622412799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.108 × 10⁹⁶(97-digit number)
41081049882328260403…50746158173244825599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.216 × 10⁹⁶(97-digit number)
82162099764656520807…01492316346489651199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.643 × 10⁹⁷(98-digit number)
16432419952931304161…02984632692979302399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.286 × 10⁹⁷(98-digit number)
32864839905862608322…05969265385958604799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.572 × 10⁹⁷(98-digit number)
65729679811725216645…11938530771917209599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.314 × 10⁹⁸(99-digit number)
13145935962345043329…23877061543834419199
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,388 XPM·at block #6,839,014 · 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