Block #465,560

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/29/2014, 1:11:38 PM · Difficulty 10.4252 · 6,342,430 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5485a925098dd6f2627444774f80d3bd2ac435388d57c2e8de98dfaa8983ef48

Height

#465,560

Difficulty

10.425184

Transactions

7

Size

1.67 KB

Version

2

Bits

0a6cd8db

Nonce

99,456

Timestamp

3/29/2014, 1:11:38 PM

Confirmations

6,342,430

Merkle Root

0d5131488416bcd632449a4313491bccab3a30316624c4496d7fecc5965b5dff
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.924 × 10⁹⁷(98-digit number)
49240975119405954963…42202496637453010381
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.924 × 10⁹⁷(98-digit number)
49240975119405954963…42202496637453010381
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.848 × 10⁹⁷(98-digit number)
98481950238811909926…84404993274906020761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.969 × 10⁹⁸(99-digit number)
19696390047762381985…68809986549812041521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.939 × 10⁹⁸(99-digit number)
39392780095524763970…37619973099624083041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.878 × 10⁹⁸(99-digit number)
78785560191049527940…75239946199248166081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.575 × 10⁹⁹(100-digit number)
15757112038209905588…50479892398496332161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.151 × 10⁹⁹(100-digit number)
31514224076419811176…00959784796992664321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.302 × 10⁹⁹(100-digit number)
63028448152839622352…01919569593985328641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.260 × 10¹⁰⁰(101-digit number)
12605689630567924470…03839139187970657281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.521 × 10¹⁰⁰(101-digit number)
25211379261135848941…07678278375941314561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.042 × 10¹⁰⁰(101-digit number)
50422758522271697882…15356556751882629121
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,707,958 XPM·at block #6,807,989 · 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