Block #515,521

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2014, 8:26:14 PM · Difficulty 10.8414 · 6,299,355 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
638fa4722338c768d54b6f2a87d51e7e66229d177ffa8f62ee6613933d85eeab

Height

#515,521

Difficulty

10.841447

Transactions

8

Size

3.22 KB

Version

2

Bits

0ad76911

Nonce

185,376,708

Timestamp

4/28/2014, 8:26:14 PM

Confirmations

6,299,355

Merkle Root

d945a3677a8210a0a6e2937cf7bdbcc8827045cbeeb2b5b8148c7b3468bba669
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.

4.918 × 10⁹⁸(99-digit number)
49188645405470719132…21822812768825662079
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
4.918 × 10⁹⁸(99-digit number)
49188645405470719132…21822812768825662079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.837 × 10⁹⁸(99-digit number)
98377290810941438264…43645625537651324159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.967 × 10⁹⁹(100-digit number)
19675458162188287652…87291251075302648319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.935 × 10⁹⁹(100-digit number)
39350916324376575305…74582502150605296639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.870 × 10⁹⁹(100-digit number)
78701832648753150611…49165004301210593279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.574 × 10¹⁰⁰(101-digit number)
15740366529750630122…98330008602421186559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.148 × 10¹⁰⁰(101-digit number)
31480733059501260244…96660017204842373119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.296 × 10¹⁰⁰(101-digit number)
62961466119002520489…93320034409684746239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.259 × 10¹⁰¹(102-digit number)
12592293223800504097…86640068819369492479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.518 × 10¹⁰¹(102-digit number)
25184586447601008195…73280137638738984959
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,763,095 XPM·at block #6,814,875 · 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