Block #546,062

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/15/2014, 4:35:07 PM · Difficulty 10.9551 · 6,269,912 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0f65afef511f8fe1e27d17b20db388427f7f06be8b5c5cdae4e6d32b40684c39

Height

#546,062

Difficulty

10.955104

Transactions

11

Size

10.63 KB

Version

2

Bits

0af481b7

Nonce

36,920

Timestamp

5/15/2014, 4:35:07 PM

Confirmations

6,269,912

Merkle Root

bebfe313c2ec708b34aa5dfe0a4cc1a895965a2701a2bc871e0ba9b49ef91332
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.936 × 10⁹⁵(96-digit number)
19367271395712105529…50304927540388116479
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.936 × 10⁹⁵(96-digit number)
19367271395712105529…50304927540388116479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.873 × 10⁹⁵(96-digit number)
38734542791424211059…00609855080776232959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.746 × 10⁹⁵(96-digit number)
77469085582848422118…01219710161552465919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.549 × 10⁹⁶(97-digit number)
15493817116569684423…02439420323104931839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.098 × 10⁹⁶(97-digit number)
30987634233139368847…04878840646209863679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.197 × 10⁹⁶(97-digit number)
61975268466278737694…09757681292419727359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.239 × 10⁹⁷(98-digit number)
12395053693255747538…19515362584839454719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.479 × 10⁹⁷(98-digit number)
24790107386511495077…39030725169678909439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.958 × 10⁹⁷(98-digit number)
49580214773022990155…78061450339357818879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.916 × 10⁹⁷(98-digit number)
99160429546045980311…56122900678715637759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.983 × 10⁹⁸(99-digit number)
19832085909209196062…12245801357431275519
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,771,904 XPM·at block #6,815,973 · 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