Block #240,419

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/2/2013, 2:50:59 PM · Difficulty 9.9566 · 6,576,751 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d3f43f45c32f7b01e757dd1f90dcec13cdaf50ff3c0270dd6c3e1fbedf7d4059

Height

#240,419

Difficulty

9.956599

Transactions

1

Size

1004 B

Version

2

Bits

09f4e3b4

Nonce

182,665

Timestamp

11/2/2013, 2:50:59 PM

Confirmations

6,576,751

Merkle Root

c9c5b2267aabbb4210e9cf32a11eaf8b06a13fb2175bcc34777438741357efd3
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.098 × 10¹⁰⁰(101-digit number)
20980848554235688886…51269476778102067199
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.098 × 10¹⁰⁰(101-digit number)
20980848554235688886…51269476778102067199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.196 × 10¹⁰⁰(101-digit number)
41961697108471377772…02538953556204134399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.392 × 10¹⁰⁰(101-digit number)
83923394216942755545…05077907112408268799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.678 × 10¹⁰¹(102-digit number)
16784678843388551109…10155814224816537599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.356 × 10¹⁰¹(102-digit number)
33569357686777102218…20311628449633075199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.713 × 10¹⁰¹(102-digit number)
67138715373554204436…40623256899266150399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.342 × 10¹⁰²(103-digit number)
13427743074710840887…81246513798532300799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.685 × 10¹⁰²(103-digit number)
26855486149421681774…62493027597064601599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.371 × 10¹⁰²(103-digit number)
53710972298843363549…24986055194129203199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.074 × 10¹⁰³(104-digit number)
10742194459768672709…49972110388258406399
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,395 XPM·at block #6,817,169 · 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