Block #309,241

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2013, 12:21:24 PM · Difficulty 9.9948 · 6,500,719 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b5914dfc907a0921fd2a4a6d488b4f0dd0d2dc6d88780a5f7418c2688f7c6d25

Height

#309,241

Difficulty

9.994764

Transactions

11

Size

4.91 KB

Version

2

Bits

09fea8d8

Nonce

1,842

Timestamp

12/13/2013, 12:21:24 PM

Confirmations

6,500,719

Merkle Root

b7bc5f578e31459494a95e1f5601269d00973feaa3bcbe33c95d4aa44dc0ba49
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.

5.121 × 10⁹⁷(98-digit number)
51211703890497949200…75748204990711208959
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
5.121 × 10⁹⁷(98-digit number)
51211703890497949200…75748204990711208959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.024 × 10⁹⁸(99-digit number)
10242340778099589840…51496409981422417919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.048 × 10⁹⁸(99-digit number)
20484681556199179680…02992819962844835839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.096 × 10⁹⁸(99-digit number)
40969363112398359360…05985639925689671679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.193 × 10⁹⁸(99-digit number)
81938726224796718720…11971279851379343359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.638 × 10⁹⁹(100-digit number)
16387745244959343744…23942559702758686719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.277 × 10⁹⁹(100-digit number)
32775490489918687488…47885119405517373439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.555 × 10⁹⁹(100-digit number)
65550980979837374976…95770238811034746879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.311 × 10¹⁰⁰(101-digit number)
13110196195967474995…91540477622069493759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.622 × 10¹⁰⁰(101-digit number)
26220392391934949990…83080955244138987519
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,723,752 XPM·at block #6,809,959 · 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