Block #291,013

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/2/2013, 11:32:55 PM · Difficulty 9.9896 · 6,535,872 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e642cb3d0b63b724cea775b060535c1bd3e2232e1ac355699e23ccd2a21d36d8

Height

#291,013

Difficulty

9.989596

Transactions

10

Size

2.76 KB

Version

2

Bits

09fd5623

Nonce

133,842

Timestamp

12/2/2013, 11:32:55 PM

Confirmations

6,535,872

Merkle Root

ab17abf3a40fc97039a0280eb985463735439c46b54986c64cf7a5b4767d1ece
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.023 × 10⁹⁸(99-digit number)
10234835574151881856…16663581660421838399
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.023 × 10⁹⁸(99-digit number)
10234835574151881856…16663581660421838399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.046 × 10⁹⁸(99-digit number)
20469671148303763712…33327163320843676799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.093 × 10⁹⁸(99-digit number)
40939342296607527424…66654326641687353599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.187 × 10⁹⁸(99-digit number)
81878684593215054849…33308653283374707199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.637 × 10⁹⁹(100-digit number)
16375736918643010969…66617306566749414399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.275 × 10⁹⁹(100-digit number)
32751473837286021939…33234613133498828799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.550 × 10⁹⁹(100-digit number)
65502947674572043879…66469226266997657599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.310 × 10¹⁰⁰(101-digit number)
13100589534914408775…32938452533995315199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.620 × 10¹⁰⁰(101-digit number)
26201179069828817551…65876905067990630399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.240 × 10¹⁰⁰(101-digit number)
52402358139657635103…31753810135981260799
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,859,245 XPM·at block #6,826,884 · 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