Block #2,099,502

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/4/2017, 1:06:28 PM · Difficulty 10.8561 · 4,741,525 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4d7d685c669527d31c14200740b509d24cc4633973f4bd3d9de2a10837146918

Height

#2,099,502

Difficulty

10.856127

Transactions

7

Size

1.50 KB

Version

2

Bits

0adb2b1f

Nonce

301,626,604

Timestamp

5/4/2017, 1:06:28 PM

Confirmations

4,741,525

Merkle Root

75b3f0a483614e19c556930b0db4fd8a07ab05525afe02ad8a242a24c4c25d6b
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.273 × 10⁹⁵(96-digit number)
22736061979666267262…74269451311358751359
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.273 × 10⁹⁵(96-digit number)
22736061979666267262…74269451311358751359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.547 × 10⁹⁵(96-digit number)
45472123959332534524…48538902622717502719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.094 × 10⁹⁵(96-digit number)
90944247918665069048…97077805245435005439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.818 × 10⁹⁶(97-digit number)
18188849583733013809…94155610490870010879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.637 × 10⁹⁶(97-digit number)
36377699167466027619…88311220981740021759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.275 × 10⁹⁶(97-digit number)
72755398334932055238…76622441963480043519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.455 × 10⁹⁷(98-digit number)
14551079666986411047…53244883926960087039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.910 × 10⁹⁷(98-digit number)
29102159333972822095…06489767853920174079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.820 × 10⁹⁷(98-digit number)
58204318667945644190…12979535707840348159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.164 × 10⁹⁸(99-digit number)
11640863733589128838…25959071415680696319
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,972,574 XPM·at block #6,841,026 · 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