Block #515,543

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/28/2014, 8:44:55 PM · Difficulty 10.8415 · 6,297,271 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6a3d448c3d17af8ed1ddda485f0eacad7af4c42d0fa30e2e656d55168d10d1a1

Height

#515,543

Difficulty

10.841542

Transactions

6

Size

1.59 KB

Version

2

Bits

0ad76f4b

Nonce

8,428,013

Timestamp

4/28/2014, 8:44:55 PM

Confirmations

6,297,271

Merkle Root

1e6d5d577289f9581284b37896be186b1df7cb645fe4ae85661683c1aa79f4ae
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.872 × 10⁹⁹(100-digit number)
18727924691222706690…49727100737501775361
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.872 × 10⁹⁹(100-digit number)
18727924691222706690…49727100737501775361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.745 × 10⁹⁹(100-digit number)
37455849382445413381…99454201475003550721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.491 × 10⁹⁹(100-digit number)
74911698764890826763…98908402950007101441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.498 × 10¹⁰⁰(101-digit number)
14982339752978165352…97816805900014202881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.996 × 10¹⁰⁰(101-digit number)
29964679505956330705…95633611800028405761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.992 × 10¹⁰⁰(101-digit number)
59929359011912661410…91267223600056811521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.198 × 10¹⁰¹(102-digit number)
11985871802382532282…82534447200113623041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.397 × 10¹⁰¹(102-digit number)
23971743604765064564…65068894400227246081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.794 × 10¹⁰¹(102-digit number)
47943487209530129128…30137788800454492161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.588 × 10¹⁰¹(102-digit number)
95886974419060258257…60275577600908984321
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,746,557 XPM·at block #6,812,813 · 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