Block #3,044,608

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 2/8/2019, 7:22:29 PM · Difficulty 11.0140 · 3,787,450 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6f0bb262049f38a05e4b5442411fa7c60396e27c287baa64ad33d6620a5c72c8

Height

#3,044,608

Difficulty

11.014045

Transactions

19

Size

6.70 KB

Version

2

Bits

0b039875

Nonce

1,524,757,479

Timestamp

2/8/2019, 7:22:29 PM

Confirmations

3,787,450

Merkle Root

bd24e96b049b5e3b7488175cc0029e1ed7f233a5a215d7485c67716634f223e3
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.155 × 10⁹⁴(95-digit number)
81557704421111672125…80871762012757170559
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.155 × 10⁹⁴(95-digit number)
81557704421111672125…80871762012757170559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.631 × 10⁹⁵(96-digit number)
16311540884222334425…61743524025514341119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.262 × 10⁹⁵(96-digit number)
32623081768444668850…23487048051028682239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.524 × 10⁹⁵(96-digit number)
65246163536889337700…46974096102057364479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.304 × 10⁹⁶(97-digit number)
13049232707377867540…93948192204114728959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.609 × 10⁹⁶(97-digit number)
26098465414755735080…87896384408229457919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.219 × 10⁹⁶(97-digit number)
52196930829511470160…75792768816458915839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.043 × 10⁹⁷(98-digit number)
10439386165902294032…51585537632917831679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.087 × 10⁹⁷(98-digit number)
20878772331804588064…03171075265835663359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.175 × 10⁹⁷(98-digit number)
41757544663609176128…06342150531671326719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.351 × 10⁹⁷(98-digit number)
83515089327218352256…12684301063342653439
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,900,596 XPM·at block #6,832,057 · 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