Block #326,957

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/24/2013, 5:04:53 AM · Difficulty 10.1804 · 6,479,485 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
702edb85a3ffdd436677def4f9eb1043d53b6f37c9801c72941e5342d8c6b6b6

Height

#326,957

Difficulty

10.180408

Transactions

8

Size

6.89 KB

Version

2

Bits

0a2e2f3b

Nonce

165,621

Timestamp

12/24/2013, 5:04:53 AM

Confirmations

6,479,485

Merkle Root

2fec0e4f479e132ce9cb931b167d8376e09c711789cbb28316d47200068fc2ec
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.407 × 10⁹⁸(99-digit number)
44072593754328766717…11680941064781598721
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.407 × 10⁹⁸(99-digit number)
44072593754328766717…11680941064781598721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.814 × 10⁹⁸(99-digit number)
88145187508657533435…23361882129563197441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.762 × 10⁹⁹(100-digit number)
17629037501731506687…46723764259126394881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.525 × 10⁹⁹(100-digit number)
35258075003463013374…93447528518252789761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.051 × 10⁹⁹(100-digit number)
70516150006926026748…86895057036505579521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.410 × 10¹⁰⁰(101-digit number)
14103230001385205349…73790114073011159041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.820 × 10¹⁰⁰(101-digit number)
28206460002770410699…47580228146022318081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.641 × 10¹⁰⁰(101-digit number)
56412920005540821399…95160456292044636161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.128 × 10¹⁰¹(102-digit number)
11282584001108164279…90320912584089272321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.256 × 10¹⁰¹(102-digit number)
22565168002216328559…80641825168178544641
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,695,625 XPM·at block #6,806,441 · 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