Block #1,690,249

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/26/2016, 4:44:07 PM · Difficulty 10.6974 · 5,154,952 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a1b295ad0e3796b074b39910bb0e0da01d00a116cbefa5cd4b5c6b6835478f43

Height

#1,690,249

Difficulty

10.697374

Transactions

2

Size

871 B

Version

2

Bits

0ab28718

Nonce

463,788,643

Timestamp

7/26/2016, 4:44:07 PM

Confirmations

5,154,952

Merkle Root

24316c6894588119e3b2e84f5ed3b1b8490531d9c0fc22905f7ae9daaf70a920
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.

1.807 × 10⁹⁵(96-digit number)
18079850449150246211…50026598460851144959
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.807 × 10⁹⁵(96-digit number)
18079850449150246211…50026598460851144959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.615 × 10⁹⁵(96-digit number)
36159700898300492423…00053196921702289919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.231 × 10⁹⁵(96-digit number)
72319401796600984846…00106393843404579839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.446 × 10⁹⁶(97-digit number)
14463880359320196969…00212787686809159679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.892 × 10⁹⁶(97-digit number)
28927760718640393938…00425575373618319359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.785 × 10⁹⁶(97-digit number)
57855521437280787877…00851150747236638719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.157 × 10⁹⁷(98-digit number)
11571104287456157575…01702301494473277439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.314 × 10⁹⁷(98-digit number)
23142208574912315150…03404602988946554879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.628 × 10⁹⁷(98-digit number)
46284417149824630301…06809205977893109759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.256 × 10⁹⁷(98-digit number)
92568834299649260603…13618411955786219519
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:58,006,041 XPM·at block #6,845,200 · 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