Block #1,694,533

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/29/2016, 8:51:06 PM · Difficulty 10.6800 · 5,136,398 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3e9bfaaf758bc70d35859e0015b10b6c233e9f525de45b0a2f9c76b6e4c4caea

Height

#1,694,533

Difficulty

10.680031

Transactions

4

Size

5.88 KB

Version

2

Bits

0aae1688

Nonce

1,787,243,359

Timestamp

7/29/2016, 8:51:06 PM

Confirmations

5,136,398

Merkle Root

7a67454d900b16389a1de82c60ccf42c79c9be550346112e44d0e951c8f65342
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.049 × 10⁹⁵(96-digit number)
10499147937361177381…14575519381925302959
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.049 × 10⁹⁵(96-digit number)
10499147937361177381…14575519381925302959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.099 × 10⁹⁵(96-digit number)
20998295874722354763…29151038763850605919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.199 × 10⁹⁵(96-digit number)
41996591749444709527…58302077527701211839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.399 × 10⁹⁵(96-digit number)
83993183498889419055…16604155055402423679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.679 × 10⁹⁶(97-digit number)
16798636699777883811…33208310110804847359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.359 × 10⁹⁶(97-digit number)
33597273399555767622…66416620221609694719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.719 × 10⁹⁶(97-digit number)
67194546799111535244…32833240443219389439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.343 × 10⁹⁷(98-digit number)
13438909359822307048…65666480886438778879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.687 × 10⁹⁷(98-digit number)
26877818719644614097…31332961772877557759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.375 × 10⁹⁷(98-digit number)
53755637439289228195…62665923545755115519
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,891,581 XPM·at block #6,830,930 · 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