Block #851,679

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2014, 12:02:34 PM · Difficulty 10.9704 · 5,991,420 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f51ba411cbdff2effce8b182ca31083445a402424bf3624b6630a4b25020ff13

Height

#851,679

Difficulty

10.970409

Transactions

4

Size

840 B

Version

2

Bits

0af86cbb

Nonce

16,572,474

Timestamp

12/13/2014, 12:02:34 PM

Confirmations

5,991,420

Merkle Root

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

3.861 × 10⁹²(93-digit number)
38616756228873336881…33258046161447481399
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
3.861 × 10⁹²(93-digit number)
38616756228873336881…33258046161447481399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.723 × 10⁹²(93-digit number)
77233512457746673763…66516092322894962799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.544 × 10⁹³(94-digit number)
15446702491549334752…33032184645789925599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.089 × 10⁹³(94-digit number)
30893404983098669505…66064369291579851199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.178 × 10⁹³(94-digit number)
61786809966197339010…32128738583159702399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.235 × 10⁹⁴(95-digit number)
12357361993239467802…64257477166319404799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.471 × 10⁹⁴(95-digit number)
24714723986478935604…28514954332638809599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.942 × 10⁹⁴(95-digit number)
49429447972957871208…57029908665277619199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.885 × 10⁹⁴(95-digit number)
98858895945915742417…14059817330555238399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.977 × 10⁹⁵(96-digit number)
19771779189183148483…28119634661110476799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.954 × 10⁹⁵(96-digit number)
39543558378366296967…56239269322220953599
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:57,989,155 XPM·at block #6,843,098 · 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