Block #1,665,423

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/9/2016, 5:58:13 AM · Difficulty 10.7141 · 5,149,415 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
16bee50dd6cca4785a7fcc244c96589f326f6fe48bfed556ba06c541cf3642d8

Height

#1,665,423

Difficulty

10.714072

Transactions

3

Size

19.43 KB

Version

2

Bits

0ab6cd66

Nonce

1,314,159,647

Timestamp

7/9/2016, 5:58:13 AM

Confirmations

5,149,415

Merkle Root

3b3ee6e43dff55950614856c09fa4b3b7d6ab956213c0ca187ee6380339ea894
Transactions (3)
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.509 × 10⁹⁴(95-digit number)
15091150414335955688…80380603064665210879
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.509 × 10⁹⁴(95-digit number)
15091150414335955688…80380603064665210879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.018 × 10⁹⁴(95-digit number)
30182300828671911377…60761206129330421759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.036 × 10⁹⁴(95-digit number)
60364601657343822754…21522412258660843519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.207 × 10⁹⁵(96-digit number)
12072920331468764550…43044824517321687039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.414 × 10⁹⁵(96-digit number)
24145840662937529101…86089649034643374079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.829 × 10⁹⁵(96-digit number)
48291681325875058203…72179298069286748159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.658 × 10⁹⁵(96-digit number)
96583362651750116407…44358596138573496319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.931 × 10⁹⁶(97-digit number)
19316672530350023281…88717192277146992639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.863 × 10⁹⁶(97-digit number)
38633345060700046562…77434384554293985279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.726 × 10⁹⁶(97-digit number)
77266690121400093125…54868769108587970559
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,762,787 XPM·at block #6,814,837 · 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