Block #586,929

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/13/2014, 9:51:39 AM · Difficulty 10.9523 · 6,223,811 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c61e67cbba3bde43b533d9eaf4666bd346bbd96bc88234377715fac5764df4db

Height

#586,929

Difficulty

10.952255

Transactions

5

Size

1.09 KB

Version

2

Bits

0af3c6f5

Nonce

50,069,467

Timestamp

6/13/2014, 9:51:39 AM

Confirmations

6,223,811

Merkle Root

c1ad1b8578e77d3990a295783b5bf87b8a8965465b92b25d9dd1a8ffa7f68c7f
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.879 × 10⁹⁷(98-digit number)
78794485390350718524…22962356478516836799
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.879 × 10⁹⁷(98-digit number)
78794485390350718524…22962356478516836799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.575 × 10⁹⁸(99-digit number)
15758897078070143704…45924712957033673599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.151 × 10⁹⁸(99-digit number)
31517794156140287409…91849425914067347199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.303 × 10⁹⁸(99-digit number)
63035588312280574819…83698851828134694399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.260 × 10⁹⁹(100-digit number)
12607117662456114963…67397703656269388799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.521 × 10⁹⁹(100-digit number)
25214235324912229927…34795407312538777599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.042 × 10⁹⁹(100-digit number)
50428470649824459855…69590814625077555199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.008 × 10¹⁰⁰(101-digit number)
10085694129964891971…39181629250155110399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.017 × 10¹⁰⁰(101-digit number)
20171388259929783942…78363258500310220799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.034 × 10¹⁰⁰(101-digit number)
40342776519859567884…56726517000620441599
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,730,011 XPM·at block #6,810,739 · 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.

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