Block #861,524

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/21/2014, 1:33:56 AM · Difficulty 10.9639 · 5,983,306 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
aae0ba0415f7b9f1a3aef6fdc148ddc252da38baefb426a85db83a98da7511ba

Height

#861,524

Difficulty

10.963917

Transactions

8

Size

1.61 KB

Version

2

Bits

0af6c343

Nonce

261,113,004

Timestamp

12/21/2014, 1:33:56 AM

Confirmations

5,983,306

Merkle Root

26de0429bfd25a51cb3aaca9ddda0f176a8470a260178c0319d114aab4ce32c3
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.

2.287 × 10⁹⁶(97-digit number)
22870821486353360708…39823103426211658399
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
2.287 × 10⁹⁶(97-digit number)
22870821486353360708…39823103426211658399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.574 × 10⁹⁶(97-digit number)
45741642972706721417…79646206852423316799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.148 × 10⁹⁶(97-digit number)
91483285945413442835…59292413704846633599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.829 × 10⁹⁷(98-digit number)
18296657189082688567…18584827409693267199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.659 × 10⁹⁷(98-digit number)
36593314378165377134…37169654819386534399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.318 × 10⁹⁷(98-digit number)
73186628756330754268…74339309638773068799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.463 × 10⁹⁸(99-digit number)
14637325751266150853…48678619277546137599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.927 × 10⁹⁸(99-digit number)
29274651502532301707…97357238555092275199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.854 × 10⁹⁸(99-digit number)
58549303005064603414…94714477110184550399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.170 × 10⁹⁹(100-digit number)
11709860601012920682…89428954220369100799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.341 × 10⁹⁹(100-digit number)
23419721202025841365…78857908440738201599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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:58,003,049 XPM·at block #6,844,829 · 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