Block #460,567

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/26/2014, 2:52:28 AM · Difficulty 10.4164 · 6,356,356 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
54b7ad86e368227b4143e62075ad60496b4a1c19d4548e8857dc3b1deb2b45d0

Height

#460,567

Difficulty

10.416407

Transactions

2

Size

723 B

Version

2

Bits

0a6a99aa

Nonce

58,071

Timestamp

3/26/2014, 2:52:28 AM

Confirmations

6,356,356

Merkle Root

56218205ef1c8d89146e2036e29399022ef14c432b29eacfe881afd0e49eaa15
Transactions (2)
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.

1.415 × 10⁹⁹(100-digit number)
14151573661042002386…25623595240286407999
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
1.415 × 10⁹⁹(100-digit number)
14151573661042002386…25623595240286407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.830 × 10⁹⁹(100-digit number)
28303147322084004773…51247190480572815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.660 × 10⁹⁹(100-digit number)
56606294644168009547…02494380961145631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.132 × 10¹⁰⁰(101-digit number)
11321258928833601909…04988761922291263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.264 × 10¹⁰⁰(101-digit number)
22642517857667203818…09977523844582527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.528 × 10¹⁰⁰(101-digit number)
45285035715334407637…19955047689165055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.057 × 10¹⁰⁰(101-digit number)
90570071430668815275…39910095378330111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.811 × 10¹⁰¹(102-digit number)
18114014286133763055…79820190756660223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.622 × 10¹⁰¹(102-digit number)
36228028572267526110…59640381513320447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.245 × 10¹⁰¹(102-digit number)
72456057144535052220…19280763026640895999
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,779,425 XPM·at block #6,816,922 · 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