Block #1,532,291

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/8/2016, 7:29:12 PM · Difficulty 10.6117 · 5,309,688 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
25d09e64b0bbfeee6b17cc575e533d5a0ad6104c2d08a459376d096b18571306

Height

#1,532,291

Difficulty

10.611690

Transactions

4

Size

1.15 KB

Version

2

Bits

0a9c97b8

Nonce

1,002,557,423

Timestamp

4/8/2016, 7:29:12 PM

Confirmations

5,309,688

Merkle Root

615337f5a0e13405bc539b9630eb5df599080c3deaddab35f907c93a3a4ef41f
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.

7.119 × 10⁹⁵(96-digit number)
71194135357785588987…17427491190489331199
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
7.119 × 10⁹⁵(96-digit number)
71194135357785588987…17427491190489331199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.423 × 10⁹⁶(97-digit number)
14238827071557117797…34854982380978662399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.847 × 10⁹⁶(97-digit number)
28477654143114235594…69709964761957324799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.695 × 10⁹⁶(97-digit number)
56955308286228471189…39419929523914649599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.139 × 10⁹⁷(98-digit number)
11391061657245694237…78839859047829299199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.278 × 10⁹⁷(98-digit number)
22782123314491388475…57679718095658598399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.556 × 10⁹⁷(98-digit number)
45564246628982776951…15359436191317196799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.112 × 10⁹⁷(98-digit number)
91128493257965553903…30718872382634393599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.822 × 10⁹⁸(99-digit number)
18225698651593110780…61437744765268787199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.645 × 10⁹⁸(99-digit number)
36451397303186221561…22875489530537574399
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,980,217 XPM·at block #6,841,978 · 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