Block #589,563

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/15/2014, 2:00:01 PM · Difficulty 10.9475 · 6,227,925 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8a412c2139cd27dab486ef9dbb076ed929bfe174a0851051418e839adb76994f

Height

#589,563

Difficulty

10.947455

Transactions

6

Size

1.45 KB

Version

2

Bits

0af28c61

Nonce

2,064,967,116

Timestamp

6/15/2014, 2:00:01 PM

Confirmations

6,227,925

Merkle Root

d5acbaba72df77053203202b74f9d3b27ce0c29f0772eb2ca7413b943a94d270
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.479 × 10⁹⁷(98-digit number)
44798403071192611670…43186137035462891801
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.479 × 10⁹⁷(98-digit number)
44798403071192611670…43186137035462891801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.959 × 10⁹⁷(98-digit number)
89596806142385223341…86372274070925783601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.791 × 10⁹⁸(99-digit number)
17919361228477044668…72744548141851567201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.583 × 10⁹⁸(99-digit number)
35838722456954089336…45489096283703134401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.167 × 10⁹⁸(99-digit number)
71677444913908178673…90978192567406268801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.433 × 10⁹⁹(100-digit number)
14335488982781635734…81956385134812537601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.867 × 10⁹⁹(100-digit number)
28670977965563271469…63912770269625075201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.734 × 10⁹⁹(100-digit number)
57341955931126542938…27825540539250150401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.146 × 10¹⁰⁰(101-digit number)
11468391186225308587…55651081078500300801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.293 × 10¹⁰⁰(101-digit number)
22936782372450617175…11302162157000601601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.587 × 10¹⁰⁰(101-digit number)
45873564744901234350…22604324314001203201
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,783,959 XPM·at block #6,817,487 · 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