Block #311,936

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2013, 7:15:43 PM · Difficulty 9.9956 · 6,505,984 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3b518ae2248cb3978696ebfec7aa2824871cbb3cbecc7957a7ed9be7d2d63606

Height

#311,936

Difficulty

9.995645

Transactions

1

Size

1.11 KB

Version

2

Bits

09fee29c

Nonce

129,122

Timestamp

12/14/2013, 7:15:43 PM

Confirmations

6,505,984

Merkle Root

2e5cf623de56a680613c95156db305eda73a56540b34fdad55cb0f886d64df1f
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.748 × 10⁹¹(92-digit number)
47484009863396408631…75541733110613235841
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.748 × 10⁹¹(92-digit number)
47484009863396408631…75541733110613235841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.496 × 10⁹¹(92-digit number)
94968019726792817262…51083466221226471681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.899 × 10⁹²(93-digit number)
18993603945358563452…02166932442452943361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.798 × 10⁹²(93-digit number)
37987207890717126904…04333864884905886721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.597 × 10⁹²(93-digit number)
75974415781434253809…08667729769811773441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.519 × 10⁹³(94-digit number)
15194883156286850761…17335459539623546881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.038 × 10⁹³(94-digit number)
30389766312573701523…34670919079247093761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.077 × 10⁹³(94-digit number)
60779532625147403047…69341838158494187521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.215 × 10⁹⁴(95-digit number)
12155906525029480609…38683676316988375041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.431 × 10⁹⁴(95-digit number)
24311813050058961219…77367352633976750081
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,787,425 XPM·at block #6,817,919 · 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