Block #310,265

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2013, 11:55:55 PM · Difficulty 9.9951 · 6,504,691 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a59816177b76df404b60bee29463f992f3f167295741b5c76e6727d534e1a673

Height

#310,265

Difficulty

9.995125

Transactions

15

Size

3.51 KB

Version

2

Bits

09fec07b

Nonce

136,348

Timestamp

12/13/2013, 11:55:55 PM

Confirmations

6,504,691

Merkle Root

89f2366c835903ca777cdae90446a25646f6d8ae78ba4735451a77776dfb5453
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.148 × 10⁹⁴(95-digit number)
11483981920196517249…72006503764810907201
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.148 × 10⁹⁴(95-digit number)
11483981920196517249…72006503764810907201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.296 × 10⁹⁴(95-digit number)
22967963840393034499…44013007529621814401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.593 × 10⁹⁴(95-digit number)
45935927680786068998…88026015059243628801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.187 × 10⁹⁴(95-digit number)
91871855361572137996…76052030118487257601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.837 × 10⁹⁵(96-digit number)
18374371072314427599…52104060236974515201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.674 × 10⁹⁵(96-digit number)
36748742144628855198…04208120473949030401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.349 × 10⁹⁵(96-digit number)
73497484289257710396…08416240947898060801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.469 × 10⁹⁶(97-digit number)
14699496857851542079…16832481895796121601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.939 × 10⁹⁶(97-digit number)
29398993715703084158…33664963791592243201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.879 × 10⁹⁶(97-digit number)
58797987431406168317…67329927583184486401
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,763,746 XPM·at block #6,814,955 · 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