Block #3,022,937

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 1/24/2019, 3:48:04 AM · Difficulty 11.1686 · 3,810,985 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a34da9df4f9d7bd4f4a60d44d49e6d02dafc4f255df6ce2e18086fc4134ca2da

Height

#3,022,937

Difficulty

11.168611

Transactions

45

Size

10.29 KB

Version

2

Bits

0b2b2a1e

Nonce

239,603,823

Timestamp

1/24/2019, 3:48:04 AM

Confirmations

3,810,985

Merkle Root

9541bcd61c5953ec4b5785cc18cbf34747449d4fe4cce2aef1700d7bfab04880
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.283 × 10⁹³(94-digit number)
12830403048061545119…90382572786535347999
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.283 × 10⁹³(94-digit number)
12830403048061545119…90382572786535347999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.566 × 10⁹³(94-digit number)
25660806096123090238…80765145573070695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.132 × 10⁹³(94-digit number)
51321612192246180477…61530291146141391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.026 × 10⁹⁴(95-digit number)
10264322438449236095…23060582292282783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.052 × 10⁹⁴(95-digit number)
20528644876898472190…46121164584565567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.105 × 10⁹⁴(95-digit number)
41057289753796944381…92242329169131135999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.211 × 10⁹⁴(95-digit number)
82114579507593888763…84484658338262271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.642 × 10⁹⁵(96-digit number)
16422915901518777752…68969316676524543999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.284 × 10⁹⁵(96-digit number)
32845831803037555505…37938633353049087999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.569 × 10⁹⁵(96-digit number)
65691663606075111010…75877266706098175999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.313 × 10⁹⁶(97-digit number)
13138332721215022202…51754533412196351999
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,915,603 XPM·at block #6,833,921 · 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