Block #585,679

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/12/2014, 10:19:09 AM · Difficulty 10.9537 · 6,231,197 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4537ce9df2c680d6f832912df55ed85a59c51492c4d803984e8b7d9cf24b2667

Height

#585,679

Difficulty

10.953726

Transactions

6

Size

36.42 KB

Version

2

Bits

0af4276b

Nonce

768,234,386

Timestamp

6/12/2014, 10:19:09 AM

Confirmations

6,231,197

Merkle Root

820c241f9c4933cca3cca0ed634c7385efc0790544ee405a79b952342f8a0e09
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.

2.867 × 10⁹⁸(99-digit number)
28674920091918262683…34685144148819055041
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
2.867 × 10⁹⁸(99-digit number)
28674920091918262683…34685144148819055041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.734 × 10⁹⁸(99-digit number)
57349840183836525366…69370288297638110081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.146 × 10⁹⁹(100-digit number)
11469968036767305073…38740576595276220161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.293 × 10⁹⁹(100-digit number)
22939936073534610146…77481153190552440321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.587 × 10⁹⁹(100-digit number)
45879872147069220293…54962306381104880641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.175 × 10⁹⁹(100-digit number)
91759744294138440586…09924612762209761281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.835 × 10¹⁰⁰(101-digit number)
18351948858827688117…19849225524419522561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.670 × 10¹⁰⁰(101-digit number)
36703897717655376234…39698451048839045121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.340 × 10¹⁰⁰(101-digit number)
73407795435310752468…79396902097678090241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.468 × 10¹⁰¹(102-digit number)
14681559087062150493…58793804195356180481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.936 × 10¹⁰¹(102-digit number)
29363118174124300987…17587608390712360961
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,779,046 XPM·at block #6,816,875 · 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