Block #316,227

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 10:54:37 PM · Difficulty 10.1291 · 6,496,045 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
daf6374a8c6f094835d858e32d91d624e14b005ae50b9c45dbb43043992ca6c6

Height

#316,227

Difficulty

10.129105

Transactions

16

Size

42.81 KB

Version

2

Bits

0a210d03

Nonce

75,594

Timestamp

12/16/2013, 10:54:37 PM

Confirmations

6,496,045

Merkle Root

80d430996907a7297c2b08acabcf3a592f18856c3c752db3ec6ab246650e24a7
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.269 × 10⁹⁵(96-digit number)
12694342281445041501…93361583752978826881
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.269 × 10⁹⁵(96-digit number)
12694342281445041501…93361583752978826881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.538 × 10⁹⁵(96-digit number)
25388684562890083003…86723167505957653761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.077 × 10⁹⁵(96-digit number)
50777369125780166007…73446335011915307521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.015 × 10⁹⁶(97-digit number)
10155473825156033201…46892670023830615041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.031 × 10⁹⁶(97-digit number)
20310947650312066402…93785340047661230081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.062 × 10⁹⁶(97-digit number)
40621895300624132805…87570680095322460161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.124 × 10⁹⁶(97-digit number)
81243790601248265611…75141360190644920321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.624 × 10⁹⁷(98-digit number)
16248758120249653122…50282720381289840641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.249 × 10⁹⁷(98-digit number)
32497516240499306244…00565440762579681281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.499 × 10⁹⁷(98-digit number)
64995032480998612489…01130881525159362561
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,742,193 XPM·at block #6,812,271 · 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