Block #318,304

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2013, 6:41:24 AM · Difficulty 10.1595 · 6,498,844 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3703ee979b091c6876015bacb020e52007bdd5bb7aa28dfd1bd4e16c9c47d64e

Height

#318,304

Difficulty

10.159490

Transactions

12

Size

8.16 KB

Version

2

Bits

0a28d45c

Nonce

308,836

Timestamp

12/18/2013, 6:41:24 AM

Confirmations

6,498,844

Merkle Root

67e9a73eaf33d75e43ee88e1a31b7f6daa55e6215621839f9c005a55998ae418
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.637 × 10¹⁰⁰(101-digit number)
16379974415126294893…28611199572670406399
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.637 × 10¹⁰⁰(101-digit number)
16379974415126294893…28611199572670406399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.275 × 10¹⁰⁰(101-digit number)
32759948830252589787…57222399145340812799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.551 × 10¹⁰⁰(101-digit number)
65519897660505179574…14444798290681625599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.310 × 10¹⁰¹(102-digit number)
13103979532101035914…28889596581363251199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.620 × 10¹⁰¹(102-digit number)
26207959064202071829…57779193162726502399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.241 × 10¹⁰¹(102-digit number)
52415918128404143659…15558386325453004799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.048 × 10¹⁰²(103-digit number)
10483183625680828731…31116772650906009599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.096 × 10¹⁰²(103-digit number)
20966367251361657463…62233545301812019199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.193 × 10¹⁰²(103-digit number)
41932734502723314927…24467090603624038399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.386 × 10¹⁰²(103-digit number)
83865469005446629855…48934181207248076799
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,781,220 XPM·at block #6,817,147 · 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