Block #856,849

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2014, 9:51:55 AM · Difficulty 10.9677 · 5,980,006 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
44a8f3e1a78a14535f877787bec5a9771e95ba71dca5878dd1345df4f98b3d01

Height

#856,849

Difficulty

10.967746

Transactions

17

Size

3.74 KB

Version

2

Bits

0af7be2e

Nonce

588,058,812

Timestamp

12/17/2014, 9:51:55 AM

Confirmations

5,980,006

Merkle Root

4909a5760395ec2a322d10f7c0334d378d394dddbdb4405eadb3e4d6665cce67
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.

7.810 × 10⁹⁵(96-digit number)
78103843260697241683…84585657076943541759
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
7.810 × 10⁹⁵(96-digit number)
78103843260697241683…84585657076943541759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.562 × 10⁹⁶(97-digit number)
15620768652139448336…69171314153887083519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.124 × 10⁹⁶(97-digit number)
31241537304278896673…38342628307774167039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.248 × 10⁹⁶(97-digit number)
62483074608557793346…76685256615548334079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.249 × 10⁹⁷(98-digit number)
12496614921711558669…53370513231096668159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.499 × 10⁹⁷(98-digit number)
24993229843423117338…06741026462193336319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.998 × 10⁹⁷(98-digit number)
49986459686846234677…13482052924386672639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.997 × 10⁹⁷(98-digit number)
99972919373692469355…26964105848773345279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.999 × 10⁹⁸(99-digit number)
19994583874738493871…53928211697546690559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.998 × 10⁹⁸(99-digit number)
39989167749476987742…07856423395093381119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.997 × 10⁹⁸(99-digit number)
79978335498953975484…15712846790186762239
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,939,128 XPM·at block #6,836,854 · 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