Block #2,457,091

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/4/2018, 10:24:38 AM · Difficulty 10.9538 · 4,381,743 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f1977ee00099e37bd4a238c26bea683c503a0706a6c267c4bb60bb59868ef2f0

Height

#2,457,091

Difficulty

10.953795

Transactions

40

Size

8.63 KB

Version

2

Bits

0af42be6

Nonce

9,040,023

Timestamp

1/4/2018, 10:24:38 AM

Confirmations

4,381,743

Merkle Root

419501eebc1b659c45a611a519a547e6a5a0e6f247da09cfd112d93025020b9c
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.

2.484 × 10⁹⁶(97-digit number)
24847045123543038939…51091409392901923839
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
2.484 × 10⁹⁶(97-digit number)
24847045123543038939…51091409392901923839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.969 × 10⁹⁶(97-digit number)
49694090247086077879…02182818785803847679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.938 × 10⁹⁶(97-digit number)
99388180494172155758…04365637571607695359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.987 × 10⁹⁷(98-digit number)
19877636098834431151…08731275143215390719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.975 × 10⁹⁷(98-digit number)
39755272197668862303…17462550286430781439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.951 × 10⁹⁷(98-digit number)
79510544395337724606…34925100572861562879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.590 × 10⁹⁸(99-digit number)
15902108879067544921…69850201145723125759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.180 × 10⁹⁸(99-digit number)
31804217758135089842…39700402291446251519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.360 × 10⁹⁸(99-digit number)
63608435516270179685…79400804582892503039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.272 × 10⁹⁹(100-digit number)
12721687103254035937…58801609165785006079
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,954,933 XPM·at block #6,838,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