Block #580,346

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/7/2014, 5:06:03 PM · Difficulty 10.9652 · 6,246,539 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7d659dbbe15ec29c47a6f0eb8933349a55737f64b637249284a85a18d93d82a5

Height

#580,346

Difficulty

10.965239

Transactions

1

Size

765 B

Version

2

Bits

0af719e0

Nonce

404,751

Timestamp

6/7/2014, 5:06:03 PM

Confirmations

6,246,539

Merkle Root

be7537c5200c9a08062660328b1ec0e3f4446a6beeb7a27f378cd9d3dbe96933
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.

3.888 × 10⁹⁵(96-digit number)
38883432560116963274…83590180184913299999
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
3.888 × 10⁹⁵(96-digit number)
38883432560116963274…83590180184913299999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.776 × 10⁹⁵(96-digit number)
77766865120233926549…67180360369826599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.555 × 10⁹⁶(97-digit number)
15553373024046785309…34360720739653199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.110 × 10⁹⁶(97-digit number)
31106746048093570619…68721441479306399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.221 × 10⁹⁶(97-digit number)
62213492096187141239…37442882958612799999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.244 × 10⁹⁷(98-digit number)
12442698419237428247…74885765917225599999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.488 × 10⁹⁷(98-digit number)
24885396838474856495…49771531834451199999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.977 × 10⁹⁷(98-digit number)
49770793676949712991…99543063668902399999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.954 × 10⁹⁷(98-digit number)
99541587353899425983…99086127337804799999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.990 × 10⁹⁸(99-digit number)
19908317470779885196…98172254675609599999
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,859,245 XPM·at block #6,826,884 · 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