Block #559,458

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/24/2014, 5:13:55 AM · Difficulty 10.9645 · 6,285,518 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4cdf18551da219d0a3d3ebbb8eb94ca0e6769bb44759ba86f06c3083ec538254

Height

#559,458

Difficulty

10.964453

Transactions

13

Size

2.99 KB

Version

2

Bits

0af6e664

Nonce

739,727,236

Timestamp

5/24/2014, 5:13:55 AM

Confirmations

6,285,518

Merkle Root

5414973ae813181cffc94e2b5118fbb45065db063c3e6838eb8855a04104f7c8
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)
14581328122530453897…79600436329398599679
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)
14581328122530453897…79600436329398599679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.916 × 10¹⁰⁰(101-digit number)
29162656245060907795…59200872658797199359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.832 × 10¹⁰⁰(101-digit number)
58325312490121815591…18401745317594398719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.166 × 10¹⁰¹(102-digit number)
11665062498024363118…36803490635188797439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.333 × 10¹⁰¹(102-digit number)
23330124996048726236…73606981270377594879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.666 × 10¹⁰¹(102-digit number)
46660249992097452473…47213962540755189759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.332 × 10¹⁰¹(102-digit number)
93320499984194904947…94427925081510379519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.866 × 10¹⁰²(103-digit number)
18664099996838980989…88855850163020759039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.732 × 10¹⁰²(103-digit number)
37328199993677961978…77711700326041518079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.465 × 10¹⁰²(103-digit number)
74656399987355923957…55423400652083036159
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:58,004,227 XPM·at block #6,844,975 · 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