Block #507,738

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/23/2014, 10:32:12 PM · Difficulty 10.8170 · 6,300,819 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
756e408a8f3b27d2f9da729b832435a1344ff456e4fe6fb568f44d403f74df99

Height

#507,738

Difficulty

10.817027

Transactions

11

Size

2.99 KB

Version

2

Bits

0ad128a8

Nonce

15,258,976

Timestamp

4/23/2014, 10:32:12 PM

Confirmations

6,300,819

Merkle Root

3b6b2a4c5890e4ef699732eb3accf6856b3c82fd9766e3bf5917c5ea663f2e58
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.

2.815 × 10⁹⁸(99-digit number)
28155867334615893501…41680782369681716959
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
2.815 × 10⁹⁸(99-digit number)
28155867334615893501…41680782369681716959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.631 × 10⁹⁸(99-digit number)
56311734669231787003…83361564739363433919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.126 × 10⁹⁹(100-digit number)
11262346933846357400…66723129478726867839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.252 × 10⁹⁹(100-digit number)
22524693867692714801…33446258957453735679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.504 × 10⁹⁹(100-digit number)
45049387735385429602…66892517914907471359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.009 × 10⁹⁹(100-digit number)
90098775470770859205…33785035829814942719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.801 × 10¹⁰⁰(101-digit number)
18019755094154171841…67570071659629885439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.603 × 10¹⁰⁰(101-digit number)
36039510188308343682…35140143319259770879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.207 × 10¹⁰⁰(101-digit number)
72079020376616687364…70280286638519541759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.441 × 10¹⁰¹(102-digit number)
14415804075323337472…40560573277039083519
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,712,513 XPM·at block #6,808,556 · 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