Block #1,083,086

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/30/2015, 4:32:15 PM · Difficulty 10.7692 · 5,726,038 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
562ac107e2803bbc63c975a7f3329b0814339f7f09db05a075ccd8fe888b4eb2

Height

#1,083,086

Difficulty

10.769201

Transactions

2

Size

1.57 KB

Version

2

Bits

0ac4ea5d

Nonce

632,119,240

Timestamp

5/30/2015, 4:32:15 PM

Confirmations

5,726,038

Merkle Root

b4defcba5c51cdcca73c0978827052a0c714b1fa0cbd52dad4a57d5812990e71
Transactions (2)
1 in → 1 out9.5900 XPM109 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.

1.576 × 10⁹⁶(97-digit number)
15768867518587875641…09052052625188326399
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.576 × 10⁹⁶(97-digit number)
15768867518587875641…09052052625188326399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.153 × 10⁹⁶(97-digit number)
31537735037175751283…18104105250376652799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.307 × 10⁹⁶(97-digit number)
63075470074351502566…36208210500753305599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.261 × 10⁹⁷(98-digit number)
12615094014870300513…72416421001506611199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.523 × 10⁹⁷(98-digit number)
25230188029740601026…44832842003013222399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.046 × 10⁹⁷(98-digit number)
50460376059481202052…89665684006026444799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.009 × 10⁹⁸(99-digit number)
10092075211896240410…79331368012052889599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.018 × 10⁹⁸(99-digit number)
20184150423792480821…58662736024105779199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.036 × 10⁹⁸(99-digit number)
40368300847584961642…17325472048211558399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.073 × 10⁹⁸(99-digit number)
80736601695169923284…34650944096423116799
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,717,050 XPM·at block #6,809,123 · 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