Block #1,658,902

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/3/2016, 8:53:29 PM · Difficulty 10.7755 · 5,166,696 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4d190632705d2ec267effb88e32fe0e4db76366fd8ccb8246bbb462dfac9137a

Height

#1,658,902

Difficulty

10.775506

Transactions

2

Size

8.79 KB

Version

2

Bits

0ac6878d

Nonce

46,734,411

Timestamp

7/3/2016, 8:53:29 PM

Confirmations

5,166,696

Merkle Root

0c04644282447ad9144e49f922a498b66b42c2a17f04b8ee2997448390a78d1d
Transactions (2)
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.

9.857 × 10⁹⁵(96-digit number)
98575589853007645278…98492506868626456319
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
9.857 × 10⁹⁵(96-digit number)
98575589853007645278…98492506868626456319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.971 × 10⁹⁶(97-digit number)
19715117970601529055…96985013737252912639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.943 × 10⁹⁶(97-digit number)
39430235941203058111…93970027474505825279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.886 × 10⁹⁶(97-digit number)
78860471882406116222…87940054949011650559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.577 × 10⁹⁷(98-digit number)
15772094376481223244…75880109898023301119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.154 × 10⁹⁷(98-digit number)
31544188752962446488…51760219796046602239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.308 × 10⁹⁷(98-digit number)
63088377505924892977…03520439592093204479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.261 × 10⁹⁸(99-digit number)
12617675501184978595…07040879184186408959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.523 × 10⁹⁸(99-digit number)
25235351002369957191…14081758368372817919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.047 × 10⁹⁸(99-digit number)
50470702004739914382…28163516736745635839
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,848,885 XPM·at block #6,825,597 · 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