Block #512,643

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/27/2014, 12:12:48 AM · Difficulty 10.8342 · 6,305,324 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5785b303705ff246c49b9d9a6439e3e7160c7eaf311a79dd617ec0407e89e06d

Height

#512,643

Difficulty

10.834152

Transactions

6

Size

1.81 KB

Version

2

Bits

0ad58aff

Nonce

19,691,301

Timestamp

4/27/2014, 12:12:48 AM

Confirmations

6,305,324

Merkle Root

abcfc1ade3f9575afdfeb5ecb0525537018047c6e8467fef5e05f7e42fde6fe8
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.098 × 10⁹⁹(100-digit number)
20985072380514273413…31519872160665108481
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.098 × 10⁹⁹(100-digit number)
20985072380514273413…31519872160665108481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.197 × 10⁹⁹(100-digit number)
41970144761028546826…63039744321330216961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.394 × 10⁹⁹(100-digit number)
83940289522057093653…26079488642660433921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.678 × 10¹⁰⁰(101-digit number)
16788057904411418730…52158977285320867841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.357 × 10¹⁰⁰(101-digit number)
33576115808822837461…04317954570641735681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.715 × 10¹⁰⁰(101-digit number)
67152231617645674922…08635909141283471361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.343 × 10¹⁰¹(102-digit number)
13430446323529134984…17271818282566942721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.686 × 10¹⁰¹(102-digit number)
26860892647058269968…34543636565133885441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.372 × 10¹⁰¹(102-digit number)
53721785294116539937…69087273130267770881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.074 × 10¹⁰²(103-digit number)
10744357058823307987…38174546260535541761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.148 × 10¹⁰²(103-digit number)
21488714117646615975…76349092521071083521
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,787,806 XPM·at block #6,817,966 · 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