Block #513,879

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/27/2014, 7:26:16 PM · Difficulty 10.8368 · 6,317,523 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4164efd4a7775e564270733cefb6cb6b2f884d50f9136ecf78a7927bfdea9b04

Height

#513,879

Difficulty

10.836804

Transactions

3

Size

810 B

Version

2

Bits

0ad638cf

Nonce

61,100,456

Timestamp

4/27/2014, 7:26:16 PM

Confirmations

6,317,523

Merkle Root

34d949cf902a713e83b2fdc34fbb8803d6f0ecbb074cbf142641671f968051cf
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.

2.965 × 10⁹⁸(99-digit number)
29654205182551533758…12633078457865599841
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
2.965 × 10⁹⁸(99-digit number)
29654205182551533758…12633078457865599841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.930 × 10⁹⁸(99-digit number)
59308410365103067516…25266156915731199681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.186 × 10⁹⁹(100-digit number)
11861682073020613503…50532313831462399361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.372 × 10⁹⁹(100-digit number)
23723364146041227006…01064627662924798721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.744 × 10⁹⁹(100-digit number)
47446728292082454013…02129255325849597441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.489 × 10⁹⁹(100-digit number)
94893456584164908026…04258510651699194881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.897 × 10¹⁰⁰(101-digit number)
18978691316832981605…08517021303398389761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.795 × 10¹⁰⁰(101-digit number)
37957382633665963210…17034042606796779521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.591 × 10¹⁰⁰(101-digit number)
75914765267331926421…34068085213593559041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.518 × 10¹⁰¹(102-digit number)
15182953053466385284…68136170427187118081
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,895,374 XPM·at block #6,831,401 · 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