Block #1,609,840

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/1/2016, 4:41:14 PM · Difficulty 10.6117 · 5,230,287 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ec15020c528ab1bda096a59999f0290a1b86421712e1f508806dc64c6781d9e7

Height

#1,609,840

Difficulty

10.611748

Transactions

2

Size

969 B

Version

2

Bits

0a9c9b82

Nonce

263,732,258

Timestamp

6/1/2016, 4:41:14 PM

Confirmations

5,230,287

Merkle Root

25030199d87ec3916c4170db697b170847f20978404573c47f4d8e6d1b0b6901
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.

4.252 × 10⁹⁵(96-digit number)
42526168476780640157…09982368197549679839
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
4.252 × 10⁹⁵(96-digit number)
42526168476780640157…09982368197549679839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.505 × 10⁹⁵(96-digit number)
85052336953561280314…19964736395099359679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.701 × 10⁹⁶(97-digit number)
17010467390712256062…39929472790198719359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.402 × 10⁹⁶(97-digit number)
34020934781424512125…79858945580397438719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.804 × 10⁹⁶(97-digit number)
68041869562849024251…59717891160794877439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.360 × 10⁹⁷(98-digit number)
13608373912569804850…19435782321589754879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.721 × 10⁹⁷(98-digit number)
27216747825139609700…38871564643179509759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.443 × 10⁹⁷(98-digit number)
54433495650279219401…77743129286359019519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.088 × 10⁹⁸(99-digit number)
10886699130055843880…55486258572718039039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.177 × 10⁹⁸(99-digit number)
21773398260111687760…10972517145436078079
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,965,330 XPM·at block #6,840,126 · 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