Block #460,478

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/26/2014, 1:24:31 AM · Difficulty 10.4166 · 6,354,570 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
59a3c042621717998d3ede970159d0f5defbf9eabe146026d5196527eb5548a6

Height

#460,478

Difficulty

10.416643

Transactions

2

Size

394 B

Version

2

Bits

0a6aa91d

Nonce

83,929

Timestamp

3/26/2014, 1:24:31 AM

Confirmations

6,354,570

Merkle Root

22007b2c758e8b6734594200cf84110d9d6e7f74acb843102c64700fa83be20f
Transactions (2)
1 in → 1 out9.2100 XPM111 B
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.

6.009 × 10⁹⁶(97-digit number)
60090824960724399979…80729559352285663429
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
6.009 × 10⁹⁶(97-digit number)
60090824960724399979…80729559352285663429
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.201 × 10⁹⁷(98-digit number)
12018164992144879995…61459118704571326859
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.403 × 10⁹⁷(98-digit number)
24036329984289759991…22918237409142653719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.807 × 10⁹⁷(98-digit number)
48072659968579519983…45836474818285307439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.614 × 10⁹⁷(98-digit number)
96145319937159039967…91672949636570614879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.922 × 10⁹⁸(99-digit number)
19229063987431807993…83345899273141229759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.845 × 10⁹⁸(99-digit number)
38458127974863615987…66691798546282459519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.691 × 10⁹⁸(99-digit number)
76916255949727231974…33383597092564919039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.538 × 10⁹⁹(100-digit number)
15383251189945446394…66767194185129838079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.076 × 10⁹⁹(100-digit number)
30766502379890892789…33534388370259676159
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,764,474 XPM·at block #6,815,047 · 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