Block #590,048

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/15/2014, 11:49:57 PM · Difficulty 10.9464 · 6,219,745 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
83f27a77835528f4d5085f9256174d884e4afdff8125e125dcd76b8251db677e

Height

#590,048

Difficulty

10.946369

Transactions

5

Size

1.37 KB

Version

2

Bits

0af2453e

Nonce

251,229,430

Timestamp

6/15/2014, 11:49:57 PM

Confirmations

6,219,745

Merkle Root

3368ae23dc78e63672ebedad6052e2c238216f3d2fd9c998cdc4b3e3c94ce118
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.

4.921 × 10⁹⁸(99-digit number)
49214376886201722319…38408742676653772799
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
4.921 × 10⁹⁸(99-digit number)
49214376886201722319…38408742676653772799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.842 × 10⁹⁸(99-digit number)
98428753772403444638…76817485353307545599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.968 × 10⁹⁹(100-digit number)
19685750754480688927…53634970706615091199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.937 × 10⁹⁹(100-digit number)
39371501508961377855…07269941413230182399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.874 × 10⁹⁹(100-digit number)
78743003017922755710…14539882826460364799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.574 × 10¹⁰⁰(101-digit number)
15748600603584551142…29079765652920729599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.149 × 10¹⁰⁰(101-digit number)
31497201207169102284…58159531305841459199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.299 × 10¹⁰⁰(101-digit number)
62994402414338204568…16319062611682918399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.259 × 10¹⁰¹(102-digit number)
12598880482867640913…32638125223365836799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.519 × 10¹⁰¹(102-digit number)
25197760965735281827…65276250446731673599
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,722,424 XPM·at block #6,809,792 · 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