Block #314,088

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/15/2013, 7:15:25 PM · Difficulty 10.0423 · 6,502,708 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a349f1449c91f256791fb3afca2474586893405601a354516f9533391a7bff58

Height

#314,088

Difficulty

10.042301

Transactions

1

Size

1.11 KB

Version

2

Bits

0a0ad439

Nonce

2,248

Timestamp

12/15/2013, 7:15:25 PM

Confirmations

6,502,708

Merkle Root

0348e3aac5cce75b1f2d8aca3523684adba1417a81d77b5eda4008decd11ddcf
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.

4.094 × 10⁹⁸(99-digit number)
40943635680118530652…03973614156776744119
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
4.094 × 10⁹⁸(99-digit number)
40943635680118530652…03973614156776744119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.188 × 10⁹⁸(99-digit number)
81887271360237061305…07947228313553488239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.637 × 10⁹⁹(100-digit number)
16377454272047412261…15894456627106976479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.275 × 10⁹⁹(100-digit number)
32754908544094824522…31788913254213952959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.550 × 10⁹⁹(100-digit number)
65509817088189649044…63577826508427905919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.310 × 10¹⁰⁰(101-digit number)
13101963417637929808…27155653016855811839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.620 × 10¹⁰⁰(101-digit number)
26203926835275859617…54311306033711623679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.240 × 10¹⁰⁰(101-digit number)
52407853670551719235…08622612067423247359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.048 × 10¹⁰¹(102-digit number)
10481570734110343847…17245224134846494719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.096 × 10¹⁰¹(102-digit number)
20963141468220687694…34490448269692989439
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,778,405 XPM·at block #6,816,795 · 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