Block #3,003,579

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/10/2019, 12:52:57 PM · Difficulty 11.2087 · 3,821,255 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6e4cf392cd409652a173791709a25fb592562f8121c382fa068e901f4da18bc3

Height

#3,003,579

Difficulty

11.208666

Transactions

17

Size

5.25 KB

Version

2

Bits

0b356b27

Nonce

1,737,432,522

Timestamp

1/10/2019, 12:52:57 PM

Confirmations

3,821,255

Merkle Root

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

4.462 × 10⁹³(94-digit number)
44629250120186975728…78093965898720573759
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
4.462 × 10⁹³(94-digit number)
44629250120186975728…78093965898720573759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.925 × 10⁹³(94-digit number)
89258500240373951457…56187931797441147519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.785 × 10⁹⁴(95-digit number)
17851700048074790291…12375863594882295039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.570 × 10⁹⁴(95-digit number)
35703400096149580582…24751727189764590079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.140 × 10⁹⁴(95-digit number)
71406800192299161165…49503454379529180159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.428 × 10⁹⁵(96-digit number)
14281360038459832233…99006908759058360319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.856 × 10⁹⁵(96-digit number)
28562720076919664466…98013817518116720639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.712 × 10⁹⁵(96-digit number)
57125440153839328932…96027635036233441279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.142 × 10⁹⁶(97-digit number)
11425088030767865786…92055270072466882559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.285 × 10⁹⁶(97-digit number)
22850176061535731573…84110540144933765119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.570 × 10⁹⁶(97-digit number)
45700352123071463146…68221080289867530239
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,842,752 XPM·at block #6,824,833 · 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