Block #477,834

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/6/2014, 5:00:37 PM · Difficulty 10.4878 · 6,330,909 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9e6b1101a46dfa3ef88c9b4e82ab08e1c56049bfa2cf5c6c82ded93ed05fa423

Height

#477,834

Difficulty

10.487817

Transactions

1

Size

935 B

Version

2

Bits

0a7ce193

Nonce

230,386

Timestamp

4/6/2014, 5:00:37 PM

Confirmations

6,330,909

Merkle Root

6cccafc6444c804df22a39e7189c94960cae2c16b3811f8831c4d053b631aa31
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.

3.851 × 10⁹⁴(95-digit number)
38511077564145785523…39652936786179205121
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
3.851 × 10⁹⁴(95-digit number)
38511077564145785523…39652936786179205121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.702 × 10⁹⁴(95-digit number)
77022155128291571046…79305873572358410241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.540 × 10⁹⁵(96-digit number)
15404431025658314209…58611747144716820481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.080 × 10⁹⁵(96-digit number)
30808862051316628418…17223494289433640961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.161 × 10⁹⁵(96-digit number)
61617724102633256837…34446988578867281921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.232 × 10⁹⁶(97-digit number)
12323544820526651367…68893977157734563841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.464 × 10⁹⁶(97-digit number)
24647089641053302734…37787954315469127681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.929 × 10⁹⁶(97-digit number)
49294179282106605469…75575908630938255361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.858 × 10⁹⁶(97-digit number)
98588358564213210939…51151817261876510721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.971 × 10⁹⁷(98-digit number)
19717671712842642187…02303634523753021441
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,713,991 XPM·at block #6,808,742 · 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