Block #2,095,698

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2017, 12:06:30 PM · Difficulty 10.8716 · 4,729,404 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5561c926bad25a15f06d43c0c62bf8080f5c6abd21dce79415ca526925d6a27c

Height

#2,095,698

Difficulty

10.871553

Transactions

13

Size

5.87 KB

Version

2

Bits

0adf1e13

Nonce

1,317,674,635

Timestamp

5/1/2017, 12:06:30 PM

Confirmations

4,729,404

Merkle Root

b252eed5eb6dc091e944aa83d871e27d28a97d3e47d29f008f4c79025ad50fb9
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.

6.175 × 10⁹⁶(97-digit number)
61750354079292051252…49723361065794570239
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
6.175 × 10⁹⁶(97-digit number)
61750354079292051252…49723361065794570239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.235 × 10⁹⁷(98-digit number)
12350070815858410250…99446722131589140479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.470 × 10⁹⁷(98-digit number)
24700141631716820501…98893444263178280959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.940 × 10⁹⁷(98-digit number)
49400283263433641002…97786888526356561919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.880 × 10⁹⁷(98-digit number)
98800566526867282004…95573777052713123839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.976 × 10⁹⁸(99-digit number)
19760113305373456400…91147554105426247679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.952 × 10⁹⁸(99-digit number)
39520226610746912801…82295108210852495359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.904 × 10⁹⁸(99-digit number)
79040453221493825603…64590216421704990719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.580 × 10⁹⁹(100-digit number)
15808090644298765120…29180432843409981439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.161 × 10⁹⁹(100-digit number)
31616181288597530241…58360865686819962879
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,844,898 XPM·at block #6,825,101 · 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