Block #291,375

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/3/2013, 3:48:28 AM · Difficulty 9.9898 · 6,519,080 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ab5da0fcb451405620f9f8e0892d2b0ddcb9551fb687c41069ed4d759dc2099f

Height

#291,375

Difficulty

9.989836

Transactions

1

Size

1.12 KB

Version

2

Bits

09fd65dc

Nonce

16,582

Timestamp

12/3/2013, 3:48:28 AM

Confirmations

6,519,080

Merkle Root

ae32ef0c96dbb37cd85227890f37839faa75aaf48b02a9fc5dc0e8e8fd84e149
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.434 × 10¹⁰³(104-digit number)
14341018342655224835…35490204381846387999
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.434 × 10¹⁰³(104-digit number)
14341018342655224835…35490204381846387999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.868 × 10¹⁰³(104-digit number)
28682036685310449670…70980408763692775999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.736 × 10¹⁰³(104-digit number)
57364073370620899340…41960817527385551999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.147 × 10¹⁰⁴(105-digit number)
11472814674124179868…83921635054771103999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.294 × 10¹⁰⁴(105-digit number)
22945629348248359736…67843270109542207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.589 × 10¹⁰⁴(105-digit number)
45891258696496719472…35686540219084415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.178 × 10¹⁰⁴(105-digit number)
91782517392993438945…71373080438168831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.835 × 10¹⁰⁵(106-digit number)
18356503478598687789…42746160876337663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.671 × 10¹⁰⁵(106-digit number)
36713006957197375578…85492321752675327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.342 × 10¹⁰⁵(106-digit number)
73426013914394751156…70984643505350655999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,727,726 XPM·at block #6,810,454 · 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.

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