Block #523,691

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/3/2014, 6:05:35 PM · Difficulty 10.8732 · 6,286,427 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
30dc81863edfc04a5d4454b4f60fb4133b1cf9a2e746147d3ef789f5a3e99c7c

Height

#523,691

Difficulty

10.873239

Transactions

6

Size

1.45 KB

Version

2

Bits

0adf8c93

Nonce

80,354,729

Timestamp

5/3/2014, 6:05:35 PM

Confirmations

6,286,427

Merkle Root

6871102a88b40d1db407a5334e5d683635b66db6fcdb42b93054a07de065a458
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.

4.035 × 10⁹⁹(100-digit number)
40357324892663297536…58529064008404809279
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
4.035 × 10⁹⁹(100-digit number)
40357324892663297536…58529064008404809279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.071 × 10⁹⁹(100-digit number)
80714649785326595072…17058128016809618559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.614 × 10¹⁰⁰(101-digit number)
16142929957065319014…34116256033619237119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.228 × 10¹⁰⁰(101-digit number)
32285859914130638029…68232512067238474239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.457 × 10¹⁰⁰(101-digit number)
64571719828261276058…36465024134476948479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.291 × 10¹⁰¹(102-digit number)
12914343965652255211…72930048268953896959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.582 × 10¹⁰¹(102-digit number)
25828687931304510423…45860096537907793919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.165 × 10¹⁰¹(102-digit number)
51657375862609020846…91720193075815587839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.033 × 10¹⁰²(103-digit number)
10331475172521804169…83440386151631175679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.066 × 10¹⁰²(103-digit number)
20662950345043608338…66880772303262351359
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,725,016 XPM·at block #6,810,117 · 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.

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