Block #515,531

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2014, 8:31:26 PM · Difficulty 10.8416 · 6,301,559 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
de6c8e5948e4b275fec630661bc15efd3f89ccbcaef330ac99b17396e0542a9d

Height

#515,531

Difficulty

10.841566

Transactions

6

Size

1.88 KB

Version

2

Bits

0ad770d9

Nonce

112,775,779

Timestamp

4/28/2014, 8:31:26 PM

Confirmations

6,301,559

Merkle Root

a4210d0a999a937a8725f126d15fe4a7cff95d97f8f6ba516c100ebab10721c7
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.501 × 10⁹⁸(99-digit number)
15019965394862164269…09136377433909411239
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.501 × 10⁹⁸(99-digit number)
15019965394862164269…09136377433909411239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.003 × 10⁹⁸(99-digit number)
30039930789724328538…18272754867818822479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.007 × 10⁹⁸(99-digit number)
60079861579448657076…36545509735637644959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.201 × 10⁹⁹(100-digit number)
12015972315889731415…73091019471275289919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.403 × 10⁹⁹(100-digit number)
24031944631779462830…46182038942550579839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.806 × 10⁹⁹(100-digit number)
48063889263558925660…92364077885101159679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.612 × 10⁹⁹(100-digit number)
96127778527117851321…84728155770202319359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.922 × 10¹⁰⁰(101-digit number)
19225555705423570264…69456311540404638719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.845 × 10¹⁰⁰(101-digit number)
38451111410847140528…38912623080809277439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.690 × 10¹⁰⁰(101-digit number)
76902222821694281057…77825246161618554879
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,780,759 XPM·at block #6,817,089 · 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