Block #2,158,492

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/13/2017, 2:55:31 AM · Difficulty 10.9050 · 4,668,618 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a459edf977a35c0c8341e051cf360be090e72a5371a672a2d67852aa5dd380bb

Height

#2,158,492

Difficulty

10.905047

Transactions

2

Size

2.55 KB

Version

2

Bits

0ae7b12b

Nonce

1,539,566,468

Timestamp

6/13/2017, 2:55:31 AM

Confirmations

4,668,618

Merkle Root

545f41764c44a8d0b7e5860b963e2d72208bbd3165e8bbb537326f9ca404cc75
Transactions (2)
1 in → 1 out8.4600 XPM109 B
16 in → 1 out86.8258 XPM2.36 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.

1.221 × 10⁹⁶(97-digit number)
12218379355341353375…57270949761951237119
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.221 × 10⁹⁶(97-digit number)
12218379355341353375…57270949761951237119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.443 × 10⁹⁶(97-digit number)
24436758710682706751…14541899523902474239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.887 × 10⁹⁶(97-digit number)
48873517421365413502…29083799047804948479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.774 × 10⁹⁶(97-digit number)
97747034842730827005…58167598095609896959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.954 × 10⁹⁷(98-digit number)
19549406968546165401…16335196191219793919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.909 × 10⁹⁷(98-digit number)
39098813937092330802…32670392382439587839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.819 × 10⁹⁷(98-digit number)
78197627874184661604…65340784764879175679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.563 × 10⁹⁸(99-digit number)
15639525574836932320…30681569529758351359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.127 × 10⁹⁸(99-digit number)
31279051149673864641…61363139059516702719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.255 × 10⁹⁸(99-digit number)
62558102299347729283…22726278119033405439
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,861,059 XPM·at block #6,827,109 · 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