Block #855,048

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2014, 1:43:23 AM · Difficulty 10.9685 · 5,976,046 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3e6447ecf058553b96396eed1014727893e361225f64e6310983a9b11b0e85f9

Height

#855,048

Difficulty

10.968496

Transactions

2

Size

391 B

Version

2

Bits

0af7ef5f

Nonce

868,095,027

Timestamp

12/16/2014, 1:43:23 AM

Confirmations

5,976,046

Merkle Root

c55ac3a853c79997c71e43106ecebf9b0a15db557679c78d925280a87f95b112
Transactions (2)
1 in → 1 out8.3170 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.

9.906 × 10⁹⁶(97-digit number)
99066039211686002277…08732091909892997119
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
9.906 × 10⁹⁶(97-digit number)
99066039211686002277…08732091909892997119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.981 × 10⁹⁷(98-digit number)
19813207842337200455…17464183819785994239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.962 × 10⁹⁷(98-digit number)
39626415684674400911…34928367639571988479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.925 × 10⁹⁷(98-digit number)
79252831369348801822…69856735279143976959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.585 × 10⁹⁸(99-digit number)
15850566273869760364…39713470558287953919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.170 × 10⁹⁸(99-digit number)
31701132547739520728…79426941116575907839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.340 × 10⁹⁸(99-digit number)
63402265095479041457…58853882233151815679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.268 × 10⁹⁹(100-digit number)
12680453019095808291…17707764466303631359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.536 × 10⁹⁹(100-digit number)
25360906038191616583…35415528932607262719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.072 × 10⁹⁹(100-digit number)
50721812076383233166…70831057865214525439
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,892,894 XPM·at block #6,831,093 · 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