Block #2,484,351

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/22/2018, 5:36:54 AM · Difficulty 10.9673 · 4,357,155 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
827ee4a862676043f08cd0bb7fed710be73b8458937ed7bba537840a3b1f51d2

Height

#2,484,351

Difficulty

10.967259

Transactions

3

Size

620 B

Version

2

Bits

0af79e49

Nonce

338,811,431

Timestamp

1/22/2018, 5:36:54 AM

Confirmations

4,357,155

Merkle Root

965cce30a1e84c331a61e3e84c0edd3f4a5d9ef5de438f6bcaa049715636c579
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.256 × 10⁹⁶(97-digit number)
12567033726732816162…07511769358812287999
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.256 × 10⁹⁶(97-digit number)
12567033726732816162…07511769358812287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.513 × 10⁹⁶(97-digit number)
25134067453465632325…15023538717624575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.026 × 10⁹⁶(97-digit number)
50268134906931264650…30047077435249151999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.005 × 10⁹⁷(98-digit number)
10053626981386252930…60094154870498303999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.010 × 10⁹⁷(98-digit number)
20107253962772505860…20188309740996607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.021 × 10⁹⁷(98-digit number)
40214507925545011720…40376619481993215999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.042 × 10⁹⁷(98-digit number)
80429015851090023440…80753238963986431999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.608 × 10⁹⁸(99-digit number)
16085803170218004688…61506477927972863999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.217 × 10⁹⁸(99-digit number)
32171606340436009376…23012955855945727999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.434 × 10⁹⁸(99-digit number)
64343212680872018752…46025911711891455999
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,976,427 XPM·at block #6,841,505 · 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