Block #310,676

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/14/2013, 4:44:18 AM · Difficulty 9.9953 · 6,497,570 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1e74d70454a7b848b9bb3e2deb7d9e409cdd468694626c0f1683dad969d2c6ad

Height

#310,676

Difficulty

9.995255

Transactions

14

Size

6.24 KB

Version

2

Bits

09fec900

Nonce

195

Timestamp

12/14/2013, 4:44:18 AM

Confirmations

6,497,570

Merkle Root

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

1.591 × 10⁹³(94-digit number)
15919133828875520232…59482640520185289299
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
1.591 × 10⁹³(94-digit number)
15919133828875520232…59482640520185289299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.183 × 10⁹³(94-digit number)
31838267657751040465…18965281040370578599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.367 × 10⁹³(94-digit number)
63676535315502080931…37930562080741157199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.273 × 10⁹⁴(95-digit number)
12735307063100416186…75861124161482314399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.547 × 10⁹⁴(95-digit number)
25470614126200832372…51722248322964628799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.094 × 10⁹⁴(95-digit number)
50941228252401664745…03444496645929257599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.018 × 10⁹⁵(96-digit number)
10188245650480332949…06888993291858515199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.037 × 10⁹⁵(96-digit number)
20376491300960665898…13777986583717030399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.075 × 10⁹⁵(96-digit number)
40752982601921331796…27555973167434060799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.150 × 10⁹⁵(96-digit number)
81505965203842663592…55111946334868121599
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,710,015 XPM·at block #6,808,245 · 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