Block #311,130

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/14/2013, 10:26:22 AM · Difficulty 9.9954 · 6,506,111 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
88209392c90645c0b1aec05cdae81c1c24f574a0a2ce9d598f7f11d6de921b89

Height

#311,130

Difficulty

9.995372

Transactions

2

Size

1.27 KB

Version

2

Bits

09fed0ac

Nonce

26,116

Timestamp

12/14/2013, 10:26:22 AM

Confirmations

6,506,111

Merkle Root

a0d6deace2a78967676a6b5dde8e065505c166b579c081deead18d6dff1184e6
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.

5.545 × 10¹⁰³(104-digit number)
55452519369857333123…47440545634956095999
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
5.545 × 10¹⁰³(104-digit number)
55452519369857333123…47440545634956095999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.109 × 10¹⁰⁴(105-digit number)
11090503873971466624…94881091269912191999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.218 × 10¹⁰⁴(105-digit number)
22181007747942933249…89762182539824383999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.436 × 10¹⁰⁴(105-digit number)
44362015495885866498…79524365079648767999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.872 × 10¹⁰⁴(105-digit number)
88724030991771732997…59048730159297535999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.774 × 10¹⁰⁵(106-digit number)
17744806198354346599…18097460318595071999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.548 × 10¹⁰⁵(106-digit number)
35489612396708693199…36194920637190143999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.097 × 10¹⁰⁵(106-digit number)
70979224793417386398…72389841274380287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.419 × 10¹⁰⁶(107-digit number)
14195844958683477279…44779682548760575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.839 × 10¹⁰⁶(107-digit number)
28391689917366954559…89559365097521151999
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,960 XPM·at block #6,817,240 · 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