Block #465,094

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/29/2014, 5:39:26 AM · Difficulty 10.4234 · 6,343,235 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4029ab8a557e669dd94db29dbf721da114b546747ae2b33e0954161d74d552f2

Height

#465,094

Difficulty

10.423440

Transactions

6

Size

1.65 KB

Version

2

Bits

0a6c6696

Nonce

47,858

Timestamp

3/29/2014, 5:39:26 AM

Confirmations

6,343,235

Merkle Root

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

4.439 × 10⁹⁸(99-digit number)
44394576635324208108…53058205491635478621
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
4.439 × 10⁹⁸(99-digit number)
44394576635324208108…53058205491635478621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.878 × 10⁹⁸(99-digit number)
88789153270648416216…06116410983270957241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.775 × 10⁹⁹(100-digit number)
17757830654129683243…12232821966541914481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.551 × 10⁹⁹(100-digit number)
35515661308259366486…24465643933083828961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.103 × 10⁹⁹(100-digit number)
71031322616518732973…48931287866167657921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.420 × 10¹⁰⁰(101-digit number)
14206264523303746594…97862575732335315841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.841 × 10¹⁰⁰(101-digit number)
28412529046607493189…95725151464670631681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.682 × 10¹⁰⁰(101-digit number)
56825058093214986378…91450302929341263361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.136 × 10¹⁰¹(102-digit number)
11365011618642997275…82900605858682526721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.273 × 10¹⁰¹(102-digit number)
22730023237285994551…65801211717365053441
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,687 XPM·at block #6,808,328 · 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