Block #314,028

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/15/2013, 6:34:14 PM · Difficulty 10.0386 · 6,502,690 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dad53a1d9c843ab028400e2b26f5a4073db68cb65bc0f31550b41b5da963bfd8

Height

#314,028

Difficulty

10.038585

Transactions

10

Size

2.33 KB

Version

2

Bits

0a09e0b9

Nonce

2,375

Timestamp

12/15/2013, 6:34:14 PM

Confirmations

6,502,690

Merkle Root

e512d667136ac83a347f2a699fb694eb4785e717bdd0ff535e534d0b8668e23e
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.851 × 10⁹⁸(99-digit number)
48518993253557884135…52136793164455139649
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.851 × 10⁹⁸(99-digit number)
48518993253557884135…52136793164455139649
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.703 × 10⁹⁸(99-digit number)
97037986507115768271…04273586328910279299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.940 × 10⁹⁹(100-digit number)
19407597301423153654…08547172657820558599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.881 × 10⁹⁹(100-digit number)
38815194602846307308…17094345315641117199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.763 × 10⁹⁹(100-digit number)
77630389205692614617…34188690631282234399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.552 × 10¹⁰⁰(101-digit number)
15526077841138522923…68377381262564468799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.105 × 10¹⁰⁰(101-digit number)
31052155682277045846…36754762525128937599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.210 × 10¹⁰⁰(101-digit number)
62104311364554091693…73509525050257875199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.242 × 10¹⁰¹(102-digit number)
12420862272910818338…47019050100515750399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.484 × 10¹⁰¹(102-digit number)
24841724545821636677…94038100201031500799
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,777,868 XPM·at block #6,816,717 · 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