Block #2,994,035

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/3/2019, 2:33:20 PM · Difficulty 11.2741 · 3,846,376 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
54905c5b0da67668972980e90696d9c9e1ddb598d207f7b80796c5af612f3da8

Height

#2,994,035

Difficulty

11.274084

Transactions

29

Size

9.33 KB

Version

2

Bits

0b462a61

Nonce

785,476,958

Timestamp

1/3/2019, 2:33:20 PM

Confirmations

3,846,376

Merkle Root

b0defa34795a5beb136b2bb042c2beabdb13acaf128d4816d02eb1759fdb5153
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.

8.071 × 10⁹⁶(97-digit number)
80711858020784780395…99427901787216322559
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
8.071 × 10⁹⁶(97-digit number)
80711858020784780395…99427901787216322559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.614 × 10⁹⁷(98-digit number)
16142371604156956079…98855803574432645119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.228 × 10⁹⁷(98-digit number)
32284743208313912158…97711607148865290239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.456 × 10⁹⁷(98-digit number)
64569486416627824316…95423214297730580479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.291 × 10⁹⁸(99-digit number)
12913897283325564863…90846428595461160959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.582 × 10⁹⁸(99-digit number)
25827794566651129726…81692857190922321919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.165 × 10⁹⁸(99-digit number)
51655589133302259453…63385714381844643839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.033 × 10⁹⁹(100-digit number)
10331117826660451890…26771428763689287679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.066 × 10⁹⁹(100-digit number)
20662235653320903781…53542857527378575359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.132 × 10⁹⁹(100-digit number)
41324471306641807562…07085715054757150719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.264 × 10⁹⁹(100-digit number)
82648942613283615125…14171430109514301439
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,967,612 XPM·at block #6,840,410 · 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