Block #583,012

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/10/2014, 5:06:13 AM · Difficulty 10.9582 · 6,225,235 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ce24b41e53980b1624d4b90238c9d1a4e78443b9a08ee9e402171d1b5e601895

Height

#583,012

Difficulty

10.958229

Transactions

8

Size

1.75 KB

Version

2

Bits

0af54e7d

Nonce

1,300,987,134

Timestamp

6/10/2014, 5:06:13 AM

Confirmations

6,225,235

Merkle Root

c82b65b78058c59b5d612fd9c90d017fed2336b502130269b01a8f38631eb2fd
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.

8.033 × 10⁹⁷(98-digit number)
80332079396309499161…53041290398080767999
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
8.033 × 10⁹⁷(98-digit number)
80332079396309499161…53041290398080767999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.606 × 10⁹⁸(99-digit number)
16066415879261899832…06082580796161535999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.213 × 10⁹⁸(99-digit number)
32132831758523799664…12165161592323071999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.426 × 10⁹⁸(99-digit number)
64265663517047599329…24330323184646143999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.285 × 10⁹⁹(100-digit number)
12853132703409519865…48660646369292287999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.570 × 10⁹⁹(100-digit number)
25706265406819039731…97321292738584575999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.141 × 10⁹⁹(100-digit number)
51412530813638079463…94642585477169151999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.028 × 10¹⁰⁰(101-digit number)
10282506162727615892…89285170954338303999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.056 × 10¹⁰⁰(101-digit number)
20565012325455231785…78570341908676607999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.113 × 10¹⁰⁰(101-digit number)
41130024650910463570…57140683817353215999
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,710,024 XPM·at block #6,808,246 · 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