Block #2,099,565

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/4/2017, 2:08:22 PM · Difficulty 10.8562 · 4,727,150 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
434d9700377d33c771b4685f019db1918339d4057746e9a96ff5fee005b65f60

Height

#2,099,565

Difficulty

10.856209

Transactions

2

Size

2.12 KB

Version

2

Bits

0adb307c

Nonce

735,483,833

Timestamp

5/4/2017, 2:08:22 PM

Confirmations

4,727,150

Merkle Root

3741ec73ef1279690353e16b4451a2d75dc83b4e1cf412bb703e11f00dabab41
Transactions (2)
1 in → 1 out8.5000 XPM109 B
13 in → 1 out837.6638 XPM1.92 KB
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.

5.913 × 10⁹⁵(96-digit number)
59136625714377312851…94346974011285268479
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
5.913 × 10⁹⁵(96-digit number)
59136625714377312851…94346974011285268479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.182 × 10⁹⁶(97-digit number)
11827325142875462570…88693948022570536959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.365 × 10⁹⁶(97-digit number)
23654650285750925140…77387896045141073919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.730 × 10⁹⁶(97-digit number)
47309300571501850281…54775792090282147839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.461 × 10⁹⁶(97-digit number)
94618601143003700563…09551584180564295679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.892 × 10⁹⁷(98-digit number)
18923720228600740112…19103168361128591359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.784 × 10⁹⁷(98-digit number)
37847440457201480225…38206336722257182719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.569 × 10⁹⁷(98-digit number)
75694880914402960450…76412673444514365439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.513 × 10⁹⁸(99-digit number)
15138976182880592090…52825346889028730879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.027 × 10⁹⁸(99-digit number)
30277952365761184180…05650693778057461759
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,857,873 XPM·at block #6,826,714 · 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