Block #460,359

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/25/2014, 11:12:44 PM · Difficulty 10.4179 · 6,348,004 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
cb55945c4b4bce4be3da458d27e53f1af4ba748c01581d85300819d086de5272

Height

#460,359

Difficulty

10.417886

Transactions

8

Size

2.36 KB

Version

2

Bits

0a6afa98

Nonce

14,431,801

Timestamp

3/25/2014, 11:12:44 PM

Confirmations

6,348,004

Merkle Root

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

3.723 × 10⁹⁵(96-digit number)
37230464916550336838…40326840592038809441
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
3.723 × 10⁹⁵(96-digit number)
37230464916550336838…40326840592038809441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.446 × 10⁹⁵(96-digit number)
74460929833100673676…80653681184077618881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.489 × 10⁹⁶(97-digit number)
14892185966620134735…61307362368155237761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.978 × 10⁹⁶(97-digit number)
29784371933240269470…22614724736310475521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.956 × 10⁹⁶(97-digit number)
59568743866480538940…45229449472620951041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.191 × 10⁹⁷(98-digit number)
11913748773296107788…90458898945241902081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.382 × 10⁹⁷(98-digit number)
23827497546592215576…80917797890483804161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.765 × 10⁹⁷(98-digit number)
47654995093184431152…61835595780967608321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.530 × 10⁹⁷(98-digit number)
95309990186368862305…23671191561935216641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.906 × 10⁹⁸(99-digit number)
19061998037273772461…47342383123870433281
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,710,956 XPM·at block #6,808,362 · 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