Block #562,535

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/26/2014, 4:08:13 AM · Difficulty 10.9663 · 6,252,517 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4865f57c9c6511920d3d49b96599d4b47ce702b5fa09094ad5fd6e07951f5f0a

Height

#562,535

Difficulty

10.966341

Transactions

1

Size

732 B

Version

2

Bits

0af76225

Nonce

259,611

Timestamp

5/26/2014, 4:08:13 AM

Confirmations

6,252,517

Merkle Root

377e7e15cbd5208053b85a2dcc413150176eb3a5d098c86ab3916f71dc98c27c
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.

2.938 × 10⁹⁷(98-digit number)
29384053358809116754…49889102847168860159
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
2.938 × 10⁹⁷(98-digit number)
29384053358809116754…49889102847168860159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.876 × 10⁹⁷(98-digit number)
58768106717618233509…99778205694337720319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.175 × 10⁹⁸(99-digit number)
11753621343523646701…99556411388675440639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.350 × 10⁹⁸(99-digit number)
23507242687047293403…99112822777350881279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.701 × 10⁹⁸(99-digit number)
47014485374094586807…98225645554701762559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.402 × 10⁹⁸(99-digit number)
94028970748189173614…96451291109403525119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.880 × 10⁹⁹(100-digit number)
18805794149637834722…92902582218807050239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.761 × 10⁹⁹(100-digit number)
37611588299275669445…85805164437614100479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.522 × 10⁹⁹(100-digit number)
75223176598551338891…71610328875228200959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.504 × 10¹⁰⁰(101-digit number)
15044635319710267778…43220657750456401919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.008 × 10¹⁰⁰(101-digit number)
30089270639420535556…86441315500912803839
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,764,507 XPM·at block #6,815,051 · 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