Block #1,607,645

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/31/2016, 4:51:46 AM · Difficulty 10.6083 · 5,208,664 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c79105203b505c0b3b8fcd124814c4a2c717b8cb45bc54919a8348041129e87d

Height

#1,607,645

Difficulty

10.608343

Transactions

5

Size

6.50 KB

Version

2

Bits

0a9bbc63

Nonce

1,015,592,404

Timestamp

5/31/2016, 4:51:46 AM

Confirmations

5,208,664

Merkle Root

3ff0c74b3e457c4725c995d57b0d63ed899d9e99d86fc327e5f5eea3f7fa06ee
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.

3.241 × 10⁹⁵(96-digit number)
32410078122382039546…02715118812368498479
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
3.241 × 10⁹⁵(96-digit number)
32410078122382039546…02715118812368498479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.482 × 10⁹⁵(96-digit number)
64820156244764079092…05430237624736996959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.296 × 10⁹⁶(97-digit number)
12964031248952815818…10860475249473993919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.592 × 10⁹⁶(97-digit number)
25928062497905631636…21720950498947987839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.185 × 10⁹⁶(97-digit number)
51856124995811263273…43441900997895975679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.037 × 10⁹⁷(98-digit number)
10371224999162252654…86883801995791951359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.074 × 10⁹⁷(98-digit number)
20742449998324505309…73767603991583902719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.148 × 10⁹⁷(98-digit number)
41484899996649010619…47535207983167805439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.296 × 10⁹⁷(98-digit number)
82969799993298021238…95070415966335610879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.659 × 10⁹⁸(99-digit number)
16593959998659604247…90140831932671221759
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,774,592 XPM·at block #6,816,308 · 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