Block #2,980,049

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/24/2018, 6:25:25 PM · Difficulty 11.2992 · 3,865,082 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
90d96f0c12e78ab59e0b367cac56a134e5a5023381a8098e285f227c3189ff97

Height

#2,980,049

Difficulty

11.299186

Transactions

3

Size

767 B

Version

2

Bits

0b4c9777

Nonce

115,536,942

Timestamp

12/24/2018, 6:25:25 PM

Confirmations

3,865,082

Merkle Root

0c84e15a319e042bcf23c6066b7686354b45e63861dee17e87b59a0dbfdc576f
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.

6.892 × 10⁹⁵(96-digit number)
68927301458728109980…39730922620243681279
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
6.892 × 10⁹⁵(96-digit number)
68927301458728109980…39730922620243681279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.378 × 10⁹⁶(97-digit number)
13785460291745621996…79461845240487362559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.757 × 10⁹⁶(97-digit number)
27570920583491243992…58923690480974725119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.514 × 10⁹⁶(97-digit number)
55141841166982487984…17847380961949450239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.102 × 10⁹⁷(98-digit number)
11028368233396497596…35694761923898900479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.205 × 10⁹⁷(98-digit number)
22056736466792995193…71389523847797800959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.411 × 10⁹⁷(98-digit number)
44113472933585990387…42779047695595601919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.822 × 10⁹⁷(98-digit number)
88226945867171980775…85558095391191203839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.764 × 10⁹⁸(99-digit number)
17645389173434396155…71116190782382407679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.529 × 10⁹⁸(99-digit number)
35290778346868792310…42232381564764815359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.058 × 10⁹⁸(99-digit number)
70581556693737584620…84464763129529630719
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:58,005,475 XPM·at block #6,845,130 · 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