Block #776,924

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/20/2014, 3:35:42 PM · Difficulty 10.9813 · 6,031,495 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
83246f1aeb7aa27d792131817a020d87c1447df955f3a7b3b5de6e3e61fcf0cd

Height

#776,924

Difficulty

10.981260

Transactions

6

Size

1.30 KB

Version

2

Bits

0afb33d9

Nonce

1,273,957,561

Timestamp

10/20/2014, 3:35:42 PM

Confirmations

6,031,495

Merkle Root

80ccfad7ee576604faa94b33a4aca9b11a6f3febf8994dccb5711895a0631409
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.

6.587 × 10⁹⁴(95-digit number)
65876369050260833759…86604514515516545139
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
6.587 × 10⁹⁴(95-digit number)
65876369050260833759…86604514515516545139
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.317 × 10⁹⁵(96-digit number)
13175273810052166751…73209029031033090279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.635 × 10⁹⁵(96-digit number)
26350547620104333503…46418058062066180559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.270 × 10⁹⁵(96-digit number)
52701095240208667007…92836116124132361119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.054 × 10⁹⁶(97-digit number)
10540219048041733401…85672232248264722239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.108 × 10⁹⁶(97-digit number)
21080438096083466803…71344464496529444479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.216 × 10⁹⁶(97-digit number)
42160876192166933606…42688928993058888959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.432 × 10⁹⁶(97-digit number)
84321752384333867212…85377857986117777919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.686 × 10⁹⁷(98-digit number)
16864350476866773442…70755715972235555839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.372 × 10⁹⁷(98-digit number)
33728700953733546884…41511431944471111679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.745 × 10⁹⁷(98-digit number)
67457401907467093769…83022863888942223359
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,711,411 XPM·at block #6,808,418 · 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