Block #862,133

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/21/2014, 12:13:57 PM · Difficulty 10.9637 · 5,962,520 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2e2d26d143446ea85e6c47d79b9d64c82cc3926c7d9bb4e8f837c9001c4bb831

Height

#862,133

Difficulty

10.963713

Transactions

5

Size

1.52 KB

Version

2

Bits

0af6b5e7

Nonce

762,042,716

Timestamp

12/21/2014, 12:13:57 PM

Confirmations

5,962,520

Merkle Root

7b9127d1421e53377be0eac48f4c2f0cb977653fade3eee40dea141aa921f858
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.745 × 10⁹⁷(98-digit number)
27455437095313180576…72871421571644426239
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.745 × 10⁹⁷(98-digit number)
27455437095313180576…72871421571644426239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.491 × 10⁹⁷(98-digit number)
54910874190626361153…45742843143288852479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.098 × 10⁹⁸(99-digit number)
10982174838125272230…91485686286577704959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.196 × 10⁹⁸(99-digit number)
21964349676250544461…82971372573155409919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.392 × 10⁹⁸(99-digit number)
43928699352501088923…65942745146310819839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.785 × 10⁹⁸(99-digit number)
87857398705002177846…31885490292621639679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.757 × 10⁹⁹(100-digit number)
17571479741000435569…63770980585243279359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.514 × 10⁹⁹(100-digit number)
35142959482000871138…27541961170486558719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.028 × 10⁹⁹(100-digit number)
70285918964001742276…55083922340973117439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.405 × 10¹⁰⁰(101-digit number)
14057183792800348455…10167844681946234879
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,841,288 XPM·at block #6,824,652 · 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