Block #595,157

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/20/2014, 2:38:23 AM · Difficulty 10.9371 · 6,220,859 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
656f16c713f107dfb666e2d1ab92cb652955083cde07f3930042b0ca43d585af

Height

#595,157

Difficulty

10.937129

Transactions

5

Size

1.37 KB

Version

2

Bits

0aefe7b4

Nonce

15,247,222

Timestamp

6/20/2014, 2:38:23 AM

Confirmations

6,220,859

Merkle Root

354ac44e0d6a3721221bb8da0b9d826130f9d73e3cd55ef41653eb3292c34be1
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.

1.272 × 10¹⁰⁰(101-digit number)
12729795523233365093…65879859569881088001
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
1.272 × 10¹⁰⁰(101-digit number)
12729795523233365093…65879859569881088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.545 × 10¹⁰⁰(101-digit number)
25459591046466730187…31759719139762176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.091 × 10¹⁰⁰(101-digit number)
50919182092933460375…63519438279524352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.018 × 10¹⁰¹(102-digit number)
10183836418586692075…27038876559048704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.036 × 10¹⁰¹(102-digit number)
20367672837173384150…54077753118097408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.073 × 10¹⁰¹(102-digit number)
40735345674346768300…08155506236194816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.147 × 10¹⁰¹(102-digit number)
81470691348693536600…16311012472389632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.629 × 10¹⁰²(103-digit number)
16294138269738707320…32622024944779264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.258 × 10¹⁰²(103-digit number)
32588276539477414640…65244049889558528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.517 × 10¹⁰²(103-digit number)
65176553078954829280…30488099779117056001
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 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
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 2CC formula:

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