Block #310,022

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2013, 9:18:44 PM · Difficulty 9.9950 · 6,506,837 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
65b5538b0a224f97470c131d4d48c9be02c72c8c914dbc81a20cdfbfbee0ef85

Height

#310,022

Difficulty

9.995033

Transactions

4

Size

1.84 KB

Version

2

Bits

09feba74

Nonce

6,419

Timestamp

12/13/2013, 9:18:44 PM

Confirmations

6,506,837

Merkle Root

8e7a10c45ef7313c3c937311869ebc9c8e52c2f1999d25e0c1c802e066305c3a
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.

9.915 × 10⁹¹(92-digit number)
99153193497845064660…48779200361167673729
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
9.915 × 10⁹¹(92-digit number)
99153193497845064660…48779200361167673729
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.983 × 10⁹²(93-digit number)
19830638699569012932…97558400722335347459
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.966 × 10⁹²(93-digit number)
39661277399138025864…95116801444670694919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.932 × 10⁹²(93-digit number)
79322554798276051728…90233602889341389839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.586 × 10⁹³(94-digit number)
15864510959655210345…80467205778682779679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.172 × 10⁹³(94-digit number)
31729021919310420691…60934411557365559359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.345 × 10⁹³(94-digit number)
63458043838620841383…21868823114731118719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.269 × 10⁹⁴(95-digit number)
12691608767724168276…43737646229462237439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.538 × 10⁹⁴(95-digit number)
25383217535448336553…87475292458924474879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.076 × 10⁹⁴(95-digit number)
50766435070896673106…74950584917848949759
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,778,916 XPM·at block #6,816,858 · 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