Block #465,675

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/29/2014, 3:22:17 PM · Difficulty 10.4245 · 6,352,261 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bbebee66de2cd9d383ce4b416b77f77c7f4f679dcf861566c61b32e38ff05c52

Height

#465,675

Difficulty

10.424482

Transactions

8

Size

36.70 KB

Version

2

Bits

0a6caad4

Nonce

240,724

Timestamp

3/29/2014, 3:22:17 PM

Confirmations

6,352,261

Merkle Root

5ffb7155567e4403663907d61501e79a3abe1dfde8c6b05a8b4ea3486c2762bf
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.929 × 10¹⁰¹(102-digit number)
19298631531161006119…32155400761025587149
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.929 × 10¹⁰¹(102-digit number)
19298631531161006119…32155400761025587149
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.859 × 10¹⁰¹(102-digit number)
38597263062322012239…64310801522051174299
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.719 × 10¹⁰¹(102-digit number)
77194526124644024478…28621603044102348599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.543 × 10¹⁰²(103-digit number)
15438905224928804895…57243206088204697199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.087 × 10¹⁰²(103-digit number)
30877810449857609791…14486412176409394399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.175 × 10¹⁰²(103-digit number)
61755620899715219582…28972824352818788799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.235 × 10¹⁰³(104-digit number)
12351124179943043916…57945648705637577599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.470 × 10¹⁰³(104-digit number)
24702248359886087833…15891297411275155199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.940 × 10¹⁰³(104-digit number)
49404496719772175666…31782594822550310399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.880 × 10¹⁰³(104-digit number)
98808993439544351332…63565189645100620799
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,787,553 XPM·at block #6,817,935 · 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