Block #530,505

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/7/2014, 10:07:02 PM · Difficulty 10.8923 · 6,286,304 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a8607f67835154186de1a2641671b41043813a89bab927eda5ca694f92d279b2

Height

#530,505

Difficulty

10.892342

Transactions

3

Size

659 B

Version

2

Bits

0ae47089

Nonce

40,599,802

Timestamp

5/7/2014, 10:07:02 PM

Confirmations

6,286,304

Merkle Root

450afc25971dfb89c63ea33a0068fa356b33fe226f9b85b233b183b7ae7563e5
Transactions (3)
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.984 × 10⁹⁹(100-digit number)
39842240201056904465…73156013748572521599
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.984 × 10⁹⁹(100-digit number)
39842240201056904465…73156013748572521599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.968 × 10⁹⁹(100-digit number)
79684480402113808931…46312027497145043199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.593 × 10¹⁰⁰(101-digit number)
15936896080422761786…92624054994290086399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.187 × 10¹⁰⁰(101-digit number)
31873792160845523572…85248109988580172799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.374 × 10¹⁰⁰(101-digit number)
63747584321691047144…70496219977160345599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.274 × 10¹⁰¹(102-digit number)
12749516864338209428…40992439954320691199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.549 × 10¹⁰¹(102-digit number)
25499033728676418857…81984879908641382399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.099 × 10¹⁰¹(102-digit number)
50998067457352837715…63969759817282764799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.019 × 10¹⁰²(103-digit number)
10199613491470567543…27939519634565529599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.039 × 10¹⁰²(103-digit number)
20399226982941135086…55879039269131059199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.079 × 10¹⁰²(103-digit number)
40798453965882270172…11758078538262118399
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,778,509 XPM·at block #6,816,808 · 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