Block #856,746

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/17/2014, 7:45:34 AM · Difficulty 10.9679 · 5,954,361 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0faa90732896737bad8e87ac44ddb37d3fea467f7604ef549a570d158e33def0

Height

#856,746

Difficulty

10.967902

Transactions

6

Size

1.37 KB

Version

2

Bits

0af7c873

Nonce

1,771,167,477

Timestamp

12/17/2014, 7:45:34 AM

Confirmations

5,954,361

Merkle Root

1c0c069d922912b217daf2a34cd92eba745fe74208057cd2c8adf9af25a97bbf
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.670 × 10⁹²(93-digit number)
36706315610234003908…33188924825077610559
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.670 × 10⁹²(93-digit number)
36706315610234003908…33188924825077610559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.341 × 10⁹²(93-digit number)
73412631220468007817…66377849650155221119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.468 × 10⁹³(94-digit number)
14682526244093601563…32755699300310442239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.936 × 10⁹³(94-digit number)
29365052488187203127…65511398600620884479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.873 × 10⁹³(94-digit number)
58730104976374406254…31022797201241768959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.174 × 10⁹⁴(95-digit number)
11746020995274881250…62045594402483537919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.349 × 10⁹⁴(95-digit number)
23492041990549762501…24091188804967075839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.698 × 10⁹⁴(95-digit number)
46984083981099525003…48182377609934151679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.396 × 10⁹⁴(95-digit number)
93968167962199050006…96364755219868303359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.879 × 10⁹⁵(96-digit number)
18793633592439810001…92729510439736606719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.758 × 10⁹⁵(96-digit number)
37587267184879620002…85459020879473213439
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,732,963 XPM·at block #6,811,106 · 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.

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