Block #312,096

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2013, 8:59:32 PM · Difficulty 9.9957 · 6,514,742 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f6960a2ddb8893348907fc65b6b7aca8fbb1814dfc13ff65ae90f65312a5e251

Height

#312,096

Difficulty

9.995700

Transactions

1

Size

1.11 KB

Version

2

Bits

09fee634

Nonce

167,242

Timestamp

12/14/2013, 8:59:32 PM

Confirmations

6,514,742

Merkle Root

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

8.167 × 10⁹¹(92-digit number)
81671448549282075638…06839734518567020801
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
8.167 × 10⁹¹(92-digit number)
81671448549282075638…06839734518567020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.633 × 10⁹²(93-digit number)
16334289709856415127…13679469037134041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.266 × 10⁹²(93-digit number)
32668579419712830255…27358938074268083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.533 × 10⁹²(93-digit number)
65337158839425660510…54717876148536166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.306 × 10⁹³(94-digit number)
13067431767885132102…09435752297072332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.613 × 10⁹³(94-digit number)
26134863535770264204…18871504594144665601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.226 × 10⁹³(94-digit number)
52269727071540528408…37743009188289331201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.045 × 10⁹⁴(95-digit number)
10453945414308105681…75486018376578662401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.090 × 10⁹⁴(95-digit number)
20907890828616211363…50972036753157324801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.181 × 10⁹⁴(95-digit number)
41815781657232422726…01944073506314649601
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,858,871 XPM·at block #6,826,837 · 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