Block #487,025

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/11/2014, 10:01:16 PM · Difficulty 10.6359 · 6,337,858 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
677544f05402e7ad87c2c1f9693935b90d56294d82ba04691725a950c29eda69

Height

#487,025

Difficulty

10.635926

Transactions

6

Size

2.74 KB

Version

2

Bits

0aa2cc08

Nonce

166,297

Timestamp

4/11/2014, 10:01:16 PM

Confirmations

6,337,858

Merkle Root

5a14feb9e3d030e3ea43a4cb7a5da4ceb9a37cc770fdb638cf334f6b7c8377cd
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.261 × 10¹⁰²(103-digit number)
12612655787236578062…21710812115021766401
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.261 × 10¹⁰²(103-digit number)
12612655787236578062…21710812115021766401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.522 × 10¹⁰²(103-digit number)
25225311574473156125…43421624230043532801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.045 × 10¹⁰²(103-digit number)
50450623148946312250…86843248460087065601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.009 × 10¹⁰³(104-digit number)
10090124629789262450…73686496920174131201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.018 × 10¹⁰³(104-digit number)
20180249259578524900…47372993840348262401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.036 × 10¹⁰³(104-digit number)
40360498519157049800…94745987680696524801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.072 × 10¹⁰³(104-digit number)
80720997038314099600…89491975361393049601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.614 × 10¹⁰⁴(105-digit number)
16144199407662819920…78983950722786099201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.228 × 10¹⁰⁴(105-digit number)
32288398815325639840…57967901445572198401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.457 × 10¹⁰⁴(105-digit number)
64576797630651279680…15935802891144396801
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,843,146 XPM·at block #6,824,882 · 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