Block #297,988

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2013, 12:24:39 AM · Difficulty 9.9919 · 6,527,706 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b0b84c98c445952748da4aa4b408b3f9e37d972211e3a6e7aa32418f371049a0

Height

#297,988

Difficulty

9.991949

Transactions

4

Size

880 B

Version

2

Bits

09fdf064

Nonce

155,008

Timestamp

12/7/2013, 12:24:39 AM

Confirmations

6,527,706

Merkle Root

052ddae178e92ed61946ef3da3c16638a538d8a59b1120ee884bed5b4645c0f6
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.230 × 10¹⁰⁰(101-digit number)
12306163593100023056…97852262003896729601
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.230 × 10¹⁰⁰(101-digit number)
12306163593100023056…97852262003896729601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.461 × 10¹⁰⁰(101-digit number)
24612327186200046112…95704524007793459201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.922 × 10¹⁰⁰(101-digit number)
49224654372400092225…91409048015586918401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.844 × 10¹⁰⁰(101-digit number)
98449308744800184450…82818096031173836801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.968 × 10¹⁰¹(102-digit number)
19689861748960036890…65636192062347673601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.937 × 10¹⁰¹(102-digit number)
39379723497920073780…31272384124695347201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.875 × 10¹⁰¹(102-digit number)
78759446995840147560…62544768249390694401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.575 × 10¹⁰²(103-digit number)
15751889399168029512…25089536498781388801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.150 × 10¹⁰²(103-digit number)
31503778798336059024…50179072997562777601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.300 × 10¹⁰²(103-digit number)
63007557596672118048…00358145995125555201
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,849,664 XPM·at block #6,825,693 · 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