Block #310,981

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2013, 8:24:13 AM · Difficulty 9.9953 · 6,528,551 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ac337cec3d74ba6830626b291cad86a7541fbdb5bc01852d993115bc4ca0a4b6

Height

#310,981

Difficulty

9.995342

Transactions

9

Size

2.40 KB

Version

2

Bits

09fecec4

Nonce

134,338

Timestamp

12/14/2013, 8:24:13 AM

Confirmations

6,528,551

Merkle Root

a21dbedf66f1ca9d62ed303ae01c32dbe581ab55ad253d8afbaa3d7cc870647e
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.192 × 10⁹²(93-digit number)
11921112199645993257…80617237801361769261
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.192 × 10⁹²(93-digit number)
11921112199645993257…80617237801361769261
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.384 × 10⁹²(93-digit number)
23842224399291986515…61234475602723538521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.768 × 10⁹²(93-digit number)
47684448798583973031…22468951205447077041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.536 × 10⁹²(93-digit number)
95368897597167946063…44937902410894154081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.907 × 10⁹³(94-digit number)
19073779519433589212…89875804821788308161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.814 × 10⁹³(94-digit number)
38147559038867178425…79751609643576616321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.629 × 10⁹³(94-digit number)
76295118077734356850…59503219287153232641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.525 × 10⁹⁴(95-digit number)
15259023615546871370…19006438574306465281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.051 × 10⁹⁴(95-digit number)
30518047231093742740…38012877148612930561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.103 × 10⁹⁴(95-digit number)
61036094462187485480…76025754297225861121
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,960,546 XPM·at block #6,839,531 · 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