Block #511,037

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/26/2014, 12:07:00 AM · Difficulty 10.8286 · 6,314,277 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6ff57b66ad0a2f18d90afe911e9adb1d4a76578f47cc3049cc0c9cb3931a44ad

Height

#511,037

Difficulty

10.828632

Transactions

11

Size

2.70 KB

Version

2

Bits

0ad42135

Nonce

50,755,559

Timestamp

4/26/2014, 12:07:00 AM

Confirmations

6,314,277

Merkle Root

35f78cef2fde20a05a96e95d7701b8003e95806514bf66914fd0b02d184ca76d
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.105 × 10¹⁰¹(102-digit number)
11059189017469657584…48586715901552486399
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.105 × 10¹⁰¹(102-digit number)
11059189017469657584…48586715901552486399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.211 × 10¹⁰¹(102-digit number)
22118378034939315168…97173431803104972799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.423 × 10¹⁰¹(102-digit number)
44236756069878630336…94346863606209945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.847 × 10¹⁰¹(102-digit number)
88473512139757260672…88693727212419891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.769 × 10¹⁰²(103-digit number)
17694702427951452134…77387454424839782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.538 × 10¹⁰²(103-digit number)
35389404855902904269…54774908849679564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.077 × 10¹⁰²(103-digit number)
70778809711805808538…09549817699359129599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.415 × 10¹⁰³(104-digit number)
14155761942361161707…19099635398718259199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.831 × 10¹⁰³(104-digit number)
28311523884722323415…38199270797436518399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.662 × 10¹⁰³(104-digit number)
56623047769444646830…76398541594873036799
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,846,615 XPM·at block #6,825,313 · 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