Block #460,555

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/26/2014, 2:38:06 AM · Difficulty 10.4166 · 6,349,226 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d8af27a37c47a4b601346ae48fbe0aaa515d1f5583db595391536ff5ff27b9ce

Height

#460,555

Difficulty

10.416611

Transactions

8

Size

3.19 KB

Version

2

Bits

0a6aa704

Nonce

587,460

Timestamp

3/26/2014, 2:38:06 AM

Confirmations

6,349,226

Merkle Root

f2f1fa15d40e6404eb0b05455549703773ba54564bbc62f2c1b3801af783038a
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.239 × 10⁹⁴(95-digit number)
52399443575008619568…92414901996190224829
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.239 × 10⁹⁴(95-digit number)
52399443575008619568…92414901996190224829
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.047 × 10⁹⁵(96-digit number)
10479888715001723913…84829803992380449659
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.095 × 10⁹⁵(96-digit number)
20959777430003447827…69659607984760899319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.191 × 10⁹⁵(96-digit number)
41919554860006895655…39319215969521798639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.383 × 10⁹⁵(96-digit number)
83839109720013791310…78638431939043597279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.676 × 10⁹⁶(97-digit number)
16767821944002758262…57276863878087194559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.353 × 10⁹⁶(97-digit number)
33535643888005516524…14553727756174389119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.707 × 10⁹⁶(97-digit number)
67071287776011033048…29107455512348778239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.341 × 10⁹⁷(98-digit number)
13414257555202206609…58214911024697556479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.682 × 10⁹⁷(98-digit number)
26828515110404413219…16429822049395112959
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,327 XPM·at block #6,809,780 · 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