Block #322,638

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/21/2013, 3:29:43 AM · Difficulty 10.1949 · 6,502,233 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
024a6014bed452aaa6e3ff92db06bdca020414a091cca59b5a987fbfed0a4d06

Height

#322,638

Difficulty

10.194854

Transactions

5

Size

1.37 KB

Version

2

Bits

0a31e1ed

Nonce

137,834

Timestamp

12/21/2013, 3:29:43 AM

Confirmations

6,502,233

Merkle Root

9a23e8eb8080ab7b59784ff4e62f042861dac94b6e4bf81bce12cc1e4d047daf
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.

3.482 × 10¹⁰⁰(101-digit number)
34827726064427419200…11661164811074622721
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
3.482 × 10¹⁰⁰(101-digit number)
34827726064427419200…11661164811074622721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.965 × 10¹⁰⁰(101-digit number)
69655452128854838400…23322329622149245441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.393 × 10¹⁰¹(102-digit number)
13931090425770967680…46644659244298490881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.786 × 10¹⁰¹(102-digit number)
27862180851541935360…93289318488596981761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.572 × 10¹⁰¹(102-digit number)
55724361703083870720…86578636977193963521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.114 × 10¹⁰²(103-digit number)
11144872340616774144…73157273954387927041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.228 × 10¹⁰²(103-digit number)
22289744681233548288…46314547908775854081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.457 × 10¹⁰²(103-digit number)
44579489362467096576…92629095817551708161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.915 × 10¹⁰²(103-digit number)
89158978724934193153…85258191635103416321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.783 × 10¹⁰³(104-digit number)
17831795744986838630…70516383270206832641
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,843,050 XPM·at block #6,824,870 · 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