Block #464,655

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/28/2014, 10:24:37 PM · Difficulty 10.4226 · 6,345,012 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5e267576a6dc597855ffc21948ddf7027e10ad13e750539daec53d9425425dc4

Height

#464,655

Difficulty

10.422629

Transactions

2

Size

850 B

Version

2

Bits

0a6c316f

Nonce

475,745

Timestamp

3/28/2014, 10:24:37 PM

Confirmations

6,345,012

Merkle Root

633c4e3d55691ab2506ea014a483d90e5b29196bf180052e3d6214232276880f
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.938 × 10⁹⁷(98-digit number)
19387002950449657727…56590195552392222721
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.938 × 10⁹⁷(98-digit number)
19387002950449657727…56590195552392222721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.877 × 10⁹⁷(98-digit number)
38774005900899315455…13180391104784445441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.754 × 10⁹⁷(98-digit number)
77548011801798630911…26360782209568890881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.550 × 10⁹⁸(99-digit number)
15509602360359726182…52721564419137781761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.101 × 10⁹⁸(99-digit number)
31019204720719452364…05443128838275563521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.203 × 10⁹⁸(99-digit number)
62038409441438904728…10886257676551127041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.240 × 10⁹⁹(100-digit number)
12407681888287780945…21772515353102254081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.481 × 10⁹⁹(100-digit number)
24815363776575561891…43545030706204508161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.963 × 10⁹⁹(100-digit number)
49630727553151123783…87090061412409016321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.926 × 10⁹⁹(100-digit number)
99261455106302247566…74180122824818032641
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,721,410 XPM·at block #6,809,666 · 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