Block #512,305

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/26/2014, 6:54:10 PM · Difficulty 10.8334 · 6,295,635 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7e02f9e320f23fd50e50a3623a40d25ae7bc9edbd9514bc5332c0c748694f3e2

Height

#512,305

Difficulty

10.833374

Transactions

4

Size

1.44 KB

Version

2

Bits

0ad557fe

Nonce

7,062

Timestamp

4/26/2014, 6:54:10 PM

Confirmations

6,295,635

Merkle Root

b3092659f1a7259ac9b9894019d9cf2b36b9ca1a4eccc52b3f531d0b96c7e46c
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.458 × 10¹⁰⁰(101-digit number)
14587704534624260559…39366283704510730239
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.458 × 10¹⁰⁰(101-digit number)
14587704534624260559…39366283704510730239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.917 × 10¹⁰⁰(101-digit number)
29175409069248521119…78732567409021460479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.835 × 10¹⁰⁰(101-digit number)
58350818138497042238…57465134818042920959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.167 × 10¹⁰¹(102-digit number)
11670163627699408447…14930269636085841919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.334 × 10¹⁰¹(102-digit number)
23340327255398816895…29860539272171683839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.668 × 10¹⁰¹(102-digit number)
46680654510797633791…59721078544343367679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.336 × 10¹⁰¹(102-digit number)
93361309021595267582…19442157088686735359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.867 × 10¹⁰²(103-digit number)
18672261804319053516…38884314177373470719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.734 × 10¹⁰²(103-digit number)
37344523608638107032…77768628354746941439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.468 × 10¹⁰²(103-digit number)
74689047217276214065…55537256709493882879
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,707,559 XPM·at block #6,807,939 · 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