Block #477,200

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/6/2014, 7:58:40 AM · Difficulty 10.4780 · 6,332,987 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
92abe98aa1e3781637380ab226e4843be43c533a32a16bfaf9e27bba541d0a1e

Height

#477,200

Difficulty

10.478004

Transactions

4

Size

882 B

Version

2

Bits

0a7a5e73

Nonce

59,324

Timestamp

4/6/2014, 7:58:40 AM

Confirmations

6,332,987

Merkle Root

b05accaca1bcc9995b23f5b08172a0d1369a88e742d66839008399fc566f3fd7
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.510 × 10¹⁰⁰(101-digit number)
15101803595529867447…34791579419327201281
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.510 × 10¹⁰⁰(101-digit number)
15101803595529867447…34791579419327201281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.020 × 10¹⁰⁰(101-digit number)
30203607191059734894…69583158838654402561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.040 × 10¹⁰⁰(101-digit number)
60407214382119469788…39166317677308805121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.208 × 10¹⁰¹(102-digit number)
12081442876423893957…78332635354617610241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.416 × 10¹⁰¹(102-digit number)
24162885752847787915…56665270709235220481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.832 × 10¹⁰¹(102-digit number)
48325771505695575830…13330541418470440961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.665 × 10¹⁰¹(102-digit number)
96651543011391151661…26661082836940881921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.933 × 10¹⁰²(103-digit number)
19330308602278230332…53322165673881763841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.866 × 10¹⁰²(103-digit number)
38660617204556460664…06644331347763527681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.732 × 10¹⁰²(103-digit number)
77321234409112921328…13288662695527055361
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,725,566 XPM·at block #6,810,186 · 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