Block #3,009,310

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/14/2019, 1:23:44 PM · Difficulty 11.1996 · 3,832,904 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
849561d6aed501c256f1c03b7a2777e982b1b04306f7600acf7ba66a0706d171

Height

#3,009,310

Difficulty

11.199615

Transactions

4

Size

924 B

Version

2

Bits

0b3319f5

Nonce

20,114,622

Timestamp

1/14/2019, 1:23:44 PM

Confirmations

3,832,904

Merkle Root

630eaaae15aaee2d6147dc1aae1e059df86ba969fe80a1fd2b1ff35ef0fcaf44
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.042 × 10⁹⁶(97-digit number)
10426154824315652618…26564786012283947359
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.042 × 10⁹⁶(97-digit number)
10426154824315652618…26564786012283947359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.085 × 10⁹⁶(97-digit number)
20852309648631305237…53129572024567894719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.170 × 10⁹⁶(97-digit number)
41704619297262610475…06259144049135789439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.340 × 10⁹⁶(97-digit number)
83409238594525220950…12518288098271578879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.668 × 10⁹⁷(98-digit number)
16681847718905044190…25036576196543157759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.336 × 10⁹⁷(98-digit number)
33363695437810088380…50073152393086315519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.672 × 10⁹⁷(98-digit number)
66727390875620176760…00146304786172631039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.334 × 10⁹⁸(99-digit number)
13345478175124035352…00292609572345262079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.669 × 10⁹⁸(99-digit number)
26690956350248070704…00585219144690524159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.338 × 10⁹⁸(99-digit number)
53381912700496141408…01170438289381048319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.067 × 10⁹⁹(100-digit number)
10676382540099228281…02340876578762096639
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,982,109 XPM·at block #6,842,213 · 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