Block #465,057

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/29/2014, 5:05:36 AM · Difficulty 10.4233 · 6,351,867 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bd53fe299dab084d026648154f3502d929ebf300aec2f3bfdad36792e5b0371f

Height

#465,057

Difficulty

10.423330

Transactions

1

Size

595 B

Version

2

Bits

0a6c5f54

Nonce

98,644

Timestamp

3/29/2014, 5:05:36 AM

Confirmations

6,351,867

Merkle Root

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

4.656 × 10⁹⁴(95-digit number)
46569718854856532388…62750242682806005519
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
4.656 × 10⁹⁴(95-digit number)
46569718854856532388…62750242682806005519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.313 × 10⁹⁴(95-digit number)
93139437709713064776…25500485365612011039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.862 × 10⁹⁵(96-digit number)
18627887541942612955…51000970731224022079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.725 × 10⁹⁵(96-digit number)
37255775083885225910…02001941462448044159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.451 × 10⁹⁵(96-digit number)
74511550167770451821…04003882924896088319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.490 × 10⁹⁶(97-digit number)
14902310033554090364…08007765849792176639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.980 × 10⁹⁶(97-digit number)
29804620067108180728…16015531699584353279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.960 × 10⁹⁶(97-digit number)
59609240134216361457…32031063399168706559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.192 × 10⁹⁷(98-digit number)
11921848026843272291…64062126798337413119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.384 × 10⁹⁷(98-digit number)
23843696053686544582…28124253596674826239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.768 × 10⁹⁷(98-digit number)
47687392107373089165…56248507193349652479
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,779,433 XPM·at block #6,816,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.
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