Block #588,723

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 6/14/2014, 9:43:44 PM · Difficulty 10.9488 · 6,220,840 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f7dd556a64acca9f06bfd1d190f3bae6c6313204ea405c7341186baef06366ae

Height

#588,723

Difficulty

10.948849

Transactions

13

Size

3.86 KB

Version

2

Bits

0af2e7c5

Nonce

794,194,990

Timestamp

6/14/2014, 9:43:44 PM

Confirmations

6,220,840

Merkle Root

77777a0b4f57e02939578c0ef12b2aff9889050f3a2a173faa210d913c7ccbaf
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.663 × 10⁹⁷(98-digit number)
46636176118044016878…63053572780296550399
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.663 × 10⁹⁷(98-digit number)
46636176118044016878…63053572780296550399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.327 × 10⁹⁷(98-digit number)
93272352236088033757…26107145560593100799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.865 × 10⁹⁸(99-digit number)
18654470447217606751…52214291121186201599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.730 × 10⁹⁸(99-digit number)
37308940894435213502…04428582242372403199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.461 × 10⁹⁸(99-digit number)
74617881788870427005…08857164484744806399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.492 × 10⁹⁹(100-digit number)
14923576357774085401…17714328969489612799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.984 × 10⁹⁹(100-digit number)
29847152715548170802…35428657938979225599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.969 × 10⁹⁹(100-digit number)
59694305431096341604…70857315877958451199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.193 × 10¹⁰⁰(101-digit number)
11938861086219268320…41714631755916902399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.387 × 10¹⁰⁰(101-digit number)
23877722172438536641…83429263511833804799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.775 × 10¹⁰⁰(101-digit number)
47755444344877073283…66858527023667609599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,720,579 XPM·at block #6,809,562 · 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