Block #314,518

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2013, 12:23:06 AM · Difficulty 10.0654 · 6,493,368 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a4b1c43a72056daa03e9dd0a6558f278084b1884cf6954ff37c3c76cde7cb860

Height

#314,518

Difficulty

10.065422

Transactions

25

Size

19.51 KB

Version

2

Bits

0a10bf78

Nonce

110,143

Timestamp

12/16/2013, 12:23:06 AM

Confirmations

6,493,368

Merkle Root

20eb59e5b63e51393dbcf3cf5eb4e7d7db84c4620f3f91925cf7c7ed280b6b73
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.

2.806 × 10¹⁰⁴(105-digit number)
28063425755282355205…79296650766746893119
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
2.806 × 10¹⁰⁴(105-digit number)
28063425755282355205…79296650766746893119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.612 × 10¹⁰⁴(105-digit number)
56126851510564710411…58593301533493786239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.122 × 10¹⁰⁵(106-digit number)
11225370302112942082…17186603066987572479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.245 × 10¹⁰⁵(106-digit number)
22450740604225884164…34373206133975144959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.490 × 10¹⁰⁵(106-digit number)
44901481208451768329…68746412267950289919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.980 × 10¹⁰⁵(106-digit number)
89802962416903536658…37492824535900579839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.796 × 10¹⁰⁶(107-digit number)
17960592483380707331…74985649071801159679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.592 × 10¹⁰⁶(107-digit number)
35921184966761414663…49971298143602319359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.184 × 10¹⁰⁶(107-digit number)
71842369933522829327…99942596287204638719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.436 × 10¹⁰⁷(108-digit number)
14368473986704565865…99885192574409277439
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,707,123 XPM·at block #6,807,885 · 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