Block #517,256

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/29/2014, 8:26:50 PM · Difficulty 10.8505 · 6,324,911 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7b93291e712c2a014254b6042ed0441557d7beddbf9111524fffe0851867d0d4

Height

#517,256

Difficulty

10.850530

Transactions

2

Size

1.14 KB

Version

2

Bits

0ad9bc59

Nonce

131,443,471

Timestamp

4/29/2014, 8:26:50 PM

Confirmations

6,324,911

Merkle Root

6bf35b5d7dc1b925fb944e24f10e994422a4c7c71f2e10fc62603d817d6b2758
Transactions (2)
1 in → 1 out8.4900 XPM116 B
8 in → 1 out82.1200 XPM955 B
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.

6.599 × 10⁹⁸(99-digit number)
65998104349567098221…82409895880432993599
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
6.599 × 10⁹⁸(99-digit number)
65998104349567098221…82409895880432993599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.319 × 10⁹⁹(100-digit number)
13199620869913419644…64819791760865987199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.639 × 10⁹⁹(100-digit number)
26399241739826839288…29639583521731974399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.279 × 10⁹⁹(100-digit number)
52798483479653678577…59279167043463948799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.055 × 10¹⁰⁰(101-digit number)
10559696695930735715…18558334086927897599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.111 × 10¹⁰⁰(101-digit number)
21119393391861471430…37116668173855795199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.223 × 10¹⁰⁰(101-digit number)
42238786783722942861…74233336347711590399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.447 × 10¹⁰⁰(101-digit number)
84477573567445885723…48466672695423180799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.689 × 10¹⁰¹(102-digit number)
16895514713489177144…96933345390846361599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.379 × 10¹⁰¹(102-digit number)
33791029426978354289…93866690781692723199
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,981,727 XPM·at block #6,842,166 · 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