Block #309,926

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2013, 8:05:23 PM · Difficulty 9.9950 · 6,521,551 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e53f016e2f72960c7e05bc377c191aca2988cb9f7ade5c568c7d96f4f0c921c7

Height

#309,926

Difficulty

9.995007

Transactions

6

Size

2.61 KB

Version

2

Bits

09feb8ca

Nonce

18,195

Timestamp

12/13/2013, 8:05:23 PM

Confirmations

6,521,551

Merkle Root

32aa885395cb35985957fccd4fe76f8afb50b37967ba752be5f10af06932ba9f
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.562 × 10⁹⁷(98-digit number)
35622112056950275074…71116193533231219359
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.562 × 10⁹⁷(98-digit number)
35622112056950275074…71116193533231219359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.124 × 10⁹⁷(98-digit number)
71244224113900550149…42232387066462438719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.424 × 10⁹⁸(99-digit number)
14248844822780110029…84464774132924877439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.849 × 10⁹⁸(99-digit number)
28497689645560220059…68929548265849754879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.699 × 10⁹⁸(99-digit number)
56995379291120440119…37859096531699509759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.139 × 10⁹⁹(100-digit number)
11399075858224088023…75718193063399019519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.279 × 10⁹⁹(100-digit number)
22798151716448176047…51436386126798039039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.559 × 10⁹⁹(100-digit number)
45596303432896352095…02872772253596078079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.119 × 10⁹⁹(100-digit number)
91192606865792704190…05745544507192156159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.823 × 10¹⁰⁰(101-digit number)
18238521373158540838…11491089014384312319
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,895,908 XPM·at block #6,831,476 · 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