Block #511,531

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/26/2014, 7:39:26 AM · Difficulty 10.8300 · 6,305,282 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d6ea506c53f4e42cc55f8752e68238a81441d21de51efde01537522f7d805b0c

Height

#511,531

Difficulty

10.830020

Transactions

1

Size

766 B

Version

2

Bits

0ad47c2c

Nonce

5,266,336

Timestamp

4/26/2014, 7:39:26 AM

Confirmations

6,305,282

Merkle Root

8af44291695e80874b77142a177b9cb679f966fe739f2429e8a8721b435af723
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.283 × 10⁹⁷(98-digit number)
12834689627081622360…36885614663687670399
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.283 × 10⁹⁷(98-digit number)
12834689627081622360…36885614663687670399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.566 × 10⁹⁷(98-digit number)
25669379254163244721…73771229327375340799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.133 × 10⁹⁷(98-digit number)
51338758508326489442…47542458654750681599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.026 × 10⁹⁸(99-digit number)
10267751701665297888…95084917309501363199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.053 × 10⁹⁸(99-digit number)
20535503403330595777…90169834619002726399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.107 × 10⁹⁸(99-digit number)
41071006806661191554…80339669238005452799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.214 × 10⁹⁸(99-digit number)
82142013613322383108…60679338476010905599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.642 × 10⁹⁹(100-digit number)
16428402722664476621…21358676952021811199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.285 × 10⁹⁹(100-digit number)
32856805445328953243…42717353904043622399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.571 × 10⁹⁹(100-digit number)
65713610890657906486…85434707808087244799
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,778,542 XPM·at block #6,816,812 · 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