Block #913,281

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/28/2015, 1:27:48 PM · Difficulty 10.9278 · 5,903,347 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
286ff23c1fae329607467595ee98e78022cdc5d7c1f2df920881d679a92b578a

Height

#913,281

Difficulty

10.927776

Transactions

8

Size

3.04 KB

Version

2

Bits

0aed82be

Nonce

57,471,568

Timestamp

1/28/2015, 1:27:48 PM

Confirmations

5,903,347

Merkle Root

aaf774a9e2bab391ad1891e38d11b2e9656675aa3ad28c09388314ac5e54cda1
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.

5.051 × 10⁹²(93-digit number)
50514603600252001844…82767955675687381759
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
5.051 × 10⁹²(93-digit number)
50514603600252001844…82767955675687381759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.010 × 10⁹³(94-digit number)
10102920720050400368…65535911351374763519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.020 × 10⁹³(94-digit number)
20205841440100800737…31071822702749527039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.041 × 10⁹³(94-digit number)
40411682880201601475…62143645405499054079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.082 × 10⁹³(94-digit number)
80823365760403202951…24287290810998108159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.616 × 10⁹⁴(95-digit number)
16164673152080640590…48574581621996216319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.232 × 10⁹⁴(95-digit number)
32329346304161281180…97149163243992432639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.465 × 10⁹⁴(95-digit number)
64658692608322562360…94298326487984865279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.293 × 10⁹⁵(96-digit number)
12931738521664512472…88596652975969730559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.586 × 10⁹⁵(96-digit number)
25863477043329024944…77193305951939461119
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,777,145 XPM·at block #6,816,627 · 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