Block #477,800

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/6/2014, 4:17:19 PM · Difficulty 10.4887 · 6,330,116 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1d166a882968f69f18782edd4b07dbed6e3062760b08e9c072ae92917ba98081

Height

#477,800

Difficulty

10.488689

Transactions

6

Size

1.77 KB

Version

2

Bits

0a7d1ab5

Nonce

231,824

Timestamp

4/6/2014, 4:17:19 PM

Confirmations

6,330,116

Merkle Root

3fea8d5d343e29e73c6073bff697be851a7b20e196fe60aa9b95bc079d34c698
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.750 × 10⁹⁹(100-digit number)
47509591051874517249…19396689735279254841
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.750 × 10⁹⁹(100-digit number)
47509591051874517249…19396689735279254841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.501 × 10⁹⁹(100-digit number)
95019182103749034499…38793379470558509681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.900 × 10¹⁰⁰(101-digit number)
19003836420749806899…77586758941117019361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.800 × 10¹⁰⁰(101-digit number)
38007672841499613799…55173517882234038721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.601 × 10¹⁰⁰(101-digit number)
76015345682999227599…10347035764468077441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.520 × 10¹⁰¹(102-digit number)
15203069136599845519…20694071528936154881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.040 × 10¹⁰¹(102-digit number)
30406138273199691039…41388143057872309761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.081 × 10¹⁰¹(102-digit number)
60812276546399382079…82776286115744619521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.216 × 10¹⁰²(103-digit number)
12162455309279876415…65552572231489239041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.432 × 10¹⁰²(103-digit number)
24324910618559752831…31105144462978478081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.864 × 10¹⁰²(103-digit number)
48649821237119505663…62210288925956956161
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,363 XPM·at block #6,807,915 · 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