Block #3,005,351

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/11/2019, 7:18:27 PM · Difficulty 11.2006 · 3,835,438 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
71c08886bbdaabe48afee927a9f5f10740c6051106b0f73467e568c9cef142f9

Height

#3,005,351

Difficulty

11.200635

Transactions

6

Size

2.41 KB

Version

2

Bits

0b335ccf

Nonce

1,870,847,378

Timestamp

1/11/2019, 7:18:27 PM

Confirmations

3,835,438

Merkle Root

985c9f875004ff42c1da04ac3897ba0d13959e83e8ed42498436cfd79a6bacbf
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.397 × 10⁹⁷(98-digit number)
13977698219423976253…93003980048040939521
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.397 × 10⁹⁷(98-digit number)
13977698219423976253…93003980048040939521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.795 × 10⁹⁷(98-digit number)
27955396438847952507…86007960096081879041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.591 × 10⁹⁷(98-digit number)
55910792877695905014…72015920192163758081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.118 × 10⁹⁸(99-digit number)
11182158575539181002…44031840384327516161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.236 × 10⁹⁸(99-digit number)
22364317151078362005…88063680768655032321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.472 × 10⁹⁸(99-digit number)
44728634302156724011…76127361537310064641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.945 × 10⁹⁸(99-digit number)
89457268604313448023…52254723074620129281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.789 × 10⁹⁹(100-digit number)
17891453720862689604…04509446149240258561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.578 × 10⁹⁹(100-digit number)
35782907441725379209…09018892298480517121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.156 × 10⁹⁹(100-digit number)
71565814883450758418…18037784596961034241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.431 × 10¹⁰⁰(101-digit number)
14313162976690151683…36075569193922068481
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,970,658 XPM·at block #6,840,788 · 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