Block #307,632

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/12/2013, 4:41:29 PM · Difficulty 9.9942 · 6,502,018 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4cfd36116f4a493eeb941ca9412a779554b9a53d09d9d36939bd0918f215ed2d

Height

#307,632

Difficulty

9.994243

Transactions

3

Size

1.18 KB

Version

2

Bits

09fe86b4

Nonce

157,470

Timestamp

12/12/2013, 4:41:29 PM

Confirmations

6,502,018

Merkle Root

f9973dd5161b955073e00d7c8200b9c6a248dcccaf479a4f48b8ce8c4ecad645
Transactions (3)
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.520 × 10⁹⁵(96-digit number)
25201145937731401779…67026671353041146881
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.520 × 10⁹⁵(96-digit number)
25201145937731401779…67026671353041146881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.040 × 10⁹⁵(96-digit number)
50402291875462803559…34053342706082293761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.008 × 10⁹⁶(97-digit number)
10080458375092560711…68106685412164587521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.016 × 10⁹⁶(97-digit number)
20160916750185121423…36213370824329175041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.032 × 10⁹⁶(97-digit number)
40321833500370242847…72426741648658350081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.064 × 10⁹⁶(97-digit number)
80643667000740485695…44853483297316700161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.612 × 10⁹⁷(98-digit number)
16128733400148097139…89706966594633400321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.225 × 10⁹⁷(98-digit number)
32257466800296194278…79413933189266800641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.451 × 10⁹⁷(98-digit number)
64514933600592388556…58827866378533601281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.290 × 10⁹⁸(99-digit number)
12902986720118477711…17655732757067202561
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,721,281 XPM·at block #6,809,649 · 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