Block #3,016,921

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/19/2019, 11:17:47 PM · Difficulty 11.1703 · 3,799,504 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f98cc313a80639ed8a80cff4ff43ba672247bb34be25cd6fa5b474eb03b7673d

Height

#3,016,921

Difficulty

11.170330

Transactions

9

Size

2.96 KB

Version

2

Bits

0b2b9ab7

Nonce

464,691,182

Timestamp

1/19/2019, 11:17:47 PM

Confirmations

3,799,504

Merkle Root

ef8d2dd206b004162d7ee5c5fa4c9665c170184da9380630817f39a61b2c732b
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.075 × 10⁹⁴(95-digit number)
10751002532420846055…64583058647546082159
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.075 × 10⁹⁴(95-digit number)
10751002532420846055…64583058647546082159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.150 × 10⁹⁴(95-digit number)
21502005064841692111…29166117295092164319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.300 × 10⁹⁴(95-digit number)
43004010129683384223…58332234590184328639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.600 × 10⁹⁴(95-digit number)
86008020259366768447…16664469180368657279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.720 × 10⁹⁵(96-digit number)
17201604051873353689…33328938360737314559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.440 × 10⁹⁵(96-digit number)
34403208103746707378…66657876721474629119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.880 × 10⁹⁵(96-digit number)
68806416207493414757…33315753442949258239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.376 × 10⁹⁶(97-digit number)
13761283241498682951…66631506885898516479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.752 × 10⁹⁶(97-digit number)
27522566482997365903…33263013771797032959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.504 × 10⁹⁶(97-digit number)
55045132965994731806…66526027543594065919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.100 × 10⁹⁷(98-digit number)
11009026593198946361…33052055087188131839
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,775,528 XPM·at block #6,816,424 · 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