Block #466,727

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/30/2014, 8:41:53 AM · Difficulty 10.4255 · 6,343,085 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
636166fe8812efe47ebac2f5afc13eafc14f75ab4dc4301413f8a08279c5c545

Height

#466,727

Difficulty

10.425483

Transactions

4

Size

1.51 KB

Version

2

Bits

0a6cec73

Nonce

310,203

Timestamp

3/30/2014, 8:41:53 AM

Confirmations

6,343,085

Merkle Root

71cc2f8fda540eabe36e5647f4756c6cab2e832ab6223d354fafd12786030e78
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.

8.603 × 10⁹⁹(100-digit number)
86037419058886644531…66693773218576407999
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
8.603 × 10⁹⁹(100-digit number)
86037419058886644531…66693773218576407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.720 × 10¹⁰⁰(101-digit number)
17207483811777328906…33387546437152815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.441 × 10¹⁰⁰(101-digit number)
34414967623554657812…66775092874305631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.882 × 10¹⁰⁰(101-digit number)
68829935247109315625…33550185748611263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.376 × 10¹⁰¹(102-digit number)
13765987049421863125…67100371497222527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.753 × 10¹⁰¹(102-digit number)
27531974098843726250…34200742994445055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.506 × 10¹⁰¹(102-digit number)
55063948197687452500…68401485988890111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.101 × 10¹⁰²(103-digit number)
11012789639537490500…36802971977780223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.202 × 10¹⁰²(103-digit number)
22025579279074981000…73605943955560447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.405 × 10¹⁰²(103-digit number)
44051158558149962000…47211887911120895999
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,722,579 XPM·at block #6,809,811 · 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