Block #299,410

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/7/2013, 10:44:30 PM · Difficulty 9.9921 · 6,506,921 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
345041eda132b0ca9949edf344336ada9b97323fadf31283778a908c1f6c7f65

Height

#299,410

Difficulty

9.992127

Transactions

7

Size

1.52 KB

Version

2

Bits

09fdfc10

Nonce

2,941

Timestamp

12/7/2013, 10:44:30 PM

Confirmations

6,506,921

Merkle Root

64013286e3af2aba6853bd7bb5d63b090c9ba88a048b24c9f80e0b32862854f6
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.

6.005 × 10¹⁰²(103-digit number)
60053076408097715117…33058695866039395199
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
6.005 × 10¹⁰²(103-digit number)
60053076408097715117…33058695866039395199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.201 × 10¹⁰³(104-digit number)
12010615281619543023…66117391732078790399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.402 × 10¹⁰³(104-digit number)
24021230563239086047…32234783464157580799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.804 × 10¹⁰³(104-digit number)
48042461126478172094…64469566928315161599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.608 × 10¹⁰³(104-digit number)
96084922252956344188…28939133856630323199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.921 × 10¹⁰⁴(105-digit number)
19216984450591268837…57878267713260646399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.843 × 10¹⁰⁴(105-digit number)
38433968901182537675…15756535426521292799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.686 × 10¹⁰⁴(105-digit number)
76867937802365075350…31513070853042585599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.537 × 10¹⁰⁵(106-digit number)
15373587560473015070…63026141706085171199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.074 × 10¹⁰⁵(106-digit number)
30747175120946030140…26052283412170342399
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,694,731 XPM·at block #6,806,330 · 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