Block #298,273

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2013, 5:35:18 AM · Difficulty 9.9919 · 6,492,669 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4f2b0957cebe9c2a8955251ba70b984be57f504e9932daeb15a1ea12d50090bb

Height

#298,273

Difficulty

9.991919

Transactions

11

Size

4.53 KB

Version

2

Bits

09fdee66

Nonce

8,244

Timestamp

12/7/2013, 5:35:18 AM

Confirmations

6,492,669

Merkle Root

d0f7956f06a14f7c471f475023b9210298b8d9cb1ee56fb755e9123b26f37914
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.378 × 10⁸⁹(90-digit number)
83784649668377068681…21786685737785103921
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.378 × 10⁸⁹(90-digit number)
83784649668377068681…21786685737785103921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.675 × 10⁹⁰(91-digit number)
16756929933675413736…43573371475570207841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.351 × 10⁹⁰(91-digit number)
33513859867350827472…87146742951140415681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.702 × 10⁹⁰(91-digit number)
67027719734701654945…74293485902280831361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.340 × 10⁹¹(92-digit number)
13405543946940330989…48586971804561662721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.681 × 10⁹¹(92-digit number)
26811087893880661978…97173943609123325441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.362 × 10⁹¹(92-digit number)
53622175787761323956…94347887218246650881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.072 × 10⁹²(93-digit number)
10724435157552264791…88695774436493301761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.144 × 10⁹²(93-digit number)
21448870315104529582…77391548872986603521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.289 × 10⁹²(93-digit number)
42897740630209059165…54783097745973207041
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,571,546 XPM·at block #6,790,941 · updates every 60s