Block #298,711

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2013, 12:15:24 PM · Difficulty 9.9920 · 6,528,475 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
327c17db62fc6922a56d43ffbfdb168fd1b41ed4f4db2db7bb4452ccf6bef2e8

Height

#298,711

Difficulty

9.991993

Transactions

4

Size

34.35 KB

Version

2

Bits

09fdf343

Nonce

43,810

Timestamp

12/7/2013, 12:15:24 PM

Confirmations

6,528,475

Merkle Root

5be4f946fbd6fecdf39bb672267c43ef661e3d46bdd9e0f5fb7cdab49723ec67
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.863 × 10⁸⁸(89-digit number)
18639290648431508123…98550705537888222801
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.863 × 10⁸⁸(89-digit number)
18639290648431508123…98550705537888222801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.727 × 10⁸⁸(89-digit number)
37278581296863016246…97101411075776445601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.455 × 10⁸⁸(89-digit number)
74557162593726032493…94202822151552891201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.491 × 10⁸⁹(90-digit number)
14911432518745206498…88405644303105782401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.982 × 10⁸⁹(90-digit number)
29822865037490412997…76811288606211564801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.964 × 10⁸⁹(90-digit number)
59645730074980825994…53622577212423129601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.192 × 10⁹⁰(91-digit number)
11929146014996165198…07245154424846259201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.385 × 10⁹⁰(91-digit number)
23858292029992330397…14490308849692518401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.771 × 10⁹⁰(91-digit number)
47716584059984660795…28980617699385036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.543 × 10⁹⁰(91-digit number)
95433168119969321591…57961235398770073601
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,861,584 XPM·at block #6,827,185 · 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