Block #464,366

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/28/2014, 6:02:23 PM · Difficulty 10.4198 · 6,348,462 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
25aa910de4daca0cdb48487be99528f442170df405bb9d77e8fea3ea3a427758

Height

#464,366

Difficulty

10.419784

Transactions

10

Size

3.16 KB

Version

2

Bits

0a6b76f5

Nonce

17,485

Timestamp

3/28/2014, 6:02:23 PM

Confirmations

6,348,462

Merkle Root

66332ca92cdbc7b4ccb0062a6ce8f1b27f8a9a89dda81f76b856378b1b2275b5
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.

8.949 × 10⁹⁵(96-digit number)
89493310278666720064…95249584900857122951
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
8.949 × 10⁹⁵(96-digit number)
89493310278666720064…95249584900857122951
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.789 × 10⁹⁶(97-digit number)
17898662055733344012…90499169801714245901
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.579 × 10⁹⁶(97-digit number)
35797324111466688025…80998339603428491801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.159 × 10⁹⁶(97-digit number)
71594648222933376051…61996679206856983601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.431 × 10⁹⁷(98-digit number)
14318929644586675210…23993358413713967201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.863 × 10⁹⁷(98-digit number)
28637859289173350420…47986716827427934401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.727 × 10⁹⁷(98-digit number)
57275718578346700841…95973433654855868801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.145 × 10⁹⁸(99-digit number)
11455143715669340168…91946867309711737601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.291 × 10⁹⁸(99-digit number)
22910287431338680336…83893734619423475201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.582 × 10⁹⁸(99-digit number)
45820574862677360673…67787469238846950401
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,746,671 XPM·at block #6,812,827 · 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