Block #545,981

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/15/2014, 3:43:01 PM · Difficulty 10.9549 · 6,296,424 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a18bc488afd10a63dca7e2782afa24a93012749257348bf2cd96c03ebc09d503

Height

#545,981

Difficulty

10.954854

Transactions

8

Size

2.73 KB

Version

2

Bits

0af47149

Nonce

218,937,484

Timestamp

5/15/2014, 3:43:01 PM

Confirmations

6,296,424

Merkle Root

8599a0f70c29a02d621c2ca4f21105b35b0827417a915bc49952ad3f41a65fb8
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.

3.933 × 10⁹⁶(97-digit number)
39339956942106395083…89645073044999847239
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
3.933 × 10⁹⁶(97-digit number)
39339956942106395083…89645073044999847239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.867 × 10⁹⁶(97-digit number)
78679913884212790167…79290146089999694479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.573 × 10⁹⁷(98-digit number)
15735982776842558033…58580292179999388959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.147 × 10⁹⁷(98-digit number)
31471965553685116066…17160584359998777919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.294 × 10⁹⁷(98-digit number)
62943931107370232133…34321168719997555839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.258 × 10⁹⁸(99-digit number)
12588786221474046426…68642337439995111679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.517 × 10⁹⁸(99-digit number)
25177572442948092853…37284674879990223359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.035 × 10⁹⁸(99-digit number)
50355144885896185707…74569349759980446719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.007 × 10⁹⁹(100-digit number)
10071028977179237141…49138699519960893439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.014 × 10⁹⁹(100-digit number)
20142057954358474282…98277399039921786879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.028 × 10⁹⁹(100-digit number)
40284115908716948565…96554798079843573759
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,983,652 XPM·at block #6,842,404 · 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