Block #465,877

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/29/2014, 6:56:48 PM · Difficulty 10.4222 · 6,361,008 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6df23affcf85a6f8c62827fe7a15d91f28159374a2bec1f90ee190b73813caac

Height

#465,877

Difficulty

10.422155

Transactions

2

Size

1.20 KB

Version

2

Bits

0a6c1257

Nonce

3,050

Timestamp

3/29/2014, 6:56:48 PM

Confirmations

6,361,008

Merkle Root

b516b0676f83eac4505e793af36234fa1e3d8197ab20764fc03f34308fc7247e
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.153 × 10⁹⁶(97-digit number)
81537336940918792263…30110589499672954799
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.153 × 10⁹⁶(97-digit number)
81537336940918792263…30110589499672954799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.630 × 10⁹⁷(98-digit number)
16307467388183758452…60221178999345909599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.261 × 10⁹⁷(98-digit number)
32614934776367516905…20442357998691819199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.522 × 10⁹⁷(98-digit number)
65229869552735033810…40884715997383638399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.304 × 10⁹⁸(99-digit number)
13045973910547006762…81769431994767276799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.609 × 10⁹⁸(99-digit number)
26091947821094013524…63538863989534553599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.218 × 10⁹⁸(99-digit number)
52183895642188027048…27077727979069107199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.043 × 10⁹⁹(100-digit number)
10436779128437605409…54155455958138214399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.087 × 10⁹⁹(100-digit number)
20873558256875210819…08310911916276428799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.174 × 10⁹⁹(100-digit number)
41747116513750421638…16621823832552857599
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,859,245 XPM·at block #6,826,884 · 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