Block #315,489

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2013, 1:13:01 PM · Difficulty 10.1025 · 6,494,435 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a06d138bf0ff46f28236d1810c58f75654a0e44435db6ce4c7379d6a3ebb6dc6

Height

#315,489

Difficulty

10.102536

Transactions

5

Size

1.40 KB

Version

2

Bits

0a1a3fcf

Nonce

115,429

Timestamp

12/16/2013, 1:13:01 PM

Confirmations

6,494,435

Merkle Root

45123fe2f421a23a15fac91a8be6fc9d3cfbccc9d6031a093af196d4b8e02162
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.338 × 10¹⁰²(103-digit number)
13381085170109213287…05744189788872497439
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.338 × 10¹⁰²(103-digit number)
13381085170109213287…05744189788872497439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.676 × 10¹⁰²(103-digit number)
26762170340218426575…11488379577744994879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.352 × 10¹⁰²(103-digit number)
53524340680436853151…22976759155489989759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.070 × 10¹⁰³(104-digit number)
10704868136087370630…45953518310979979519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.140 × 10¹⁰³(104-digit number)
21409736272174741260…91907036621959959039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.281 × 10¹⁰³(104-digit number)
42819472544349482520…83814073243919918079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.563 × 10¹⁰³(104-digit number)
85638945088698965041…67628146487839836159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.712 × 10¹⁰⁴(105-digit number)
17127789017739793008…35256292975679672319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.425 × 10¹⁰⁴(105-digit number)
34255578035479586016…70512585951359344639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.851 × 10¹⁰⁴(105-digit number)
68511156070959172033…41025171902718689279
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,723,478 XPM·at block #6,809,923 · 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