Block #312,941

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2013, 6:09:52 AM · Difficulty 9.9960 · 6,517,600 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e59edba734143ae48e2d52a6de77f5662a745c5d642a36eb60f4cdebd66276f9

Height

#312,941

Difficulty

9.995968

Transactions

7

Size

2.53 KB

Version

2

Bits

09fef7c0

Nonce

16,189

Timestamp

12/15/2013, 6:09:52 AM

Confirmations

6,517,600

Merkle Root

40e85f3b3984c2a32cc5b4d1cc98a10820ae269417f7e890751dbbd434fb9021
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.096 × 10⁹¹(92-digit number)
10967574086567545731…33963049240460645441
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.096 × 10⁹¹(92-digit number)
10967574086567545731…33963049240460645441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.193 × 10⁹¹(92-digit number)
21935148173135091463…67926098480921290881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.387 × 10⁹¹(92-digit number)
43870296346270182927…35852196961842581761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.774 × 10⁹¹(92-digit number)
87740592692540365855…71704393923685163521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.754 × 10⁹²(93-digit number)
17548118538508073171…43408787847370327041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.509 × 10⁹²(93-digit number)
35096237077016146342…86817575694740654081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.019 × 10⁹²(93-digit number)
70192474154032292684…73635151389481308161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.403 × 10⁹³(94-digit number)
14038494830806458536…47270302778962616321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.807 × 10⁹³(94-digit number)
28076989661612917073…94540605557925232641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.615 × 10⁹³(94-digit number)
56153979323225834147…89081211115850465281
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,888,576 XPM·at block #6,830,540 · 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