Block #778,280

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/21/2014, 3:15:21 PM · Difficulty 10.9811 · 6,032,310 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d2e64afb7fc1d36a373496366030fb8d5069607c77067e8565d5c0cfcc010975

Height

#778,280

Difficulty

10.981058

Transactions

4

Size

885 B

Version

2

Bits

0afb269e

Nonce

410,475,387

Timestamp

10/21/2014, 3:15:21 PM

Confirmations

6,032,310

Merkle Root

5b8488abbc1aa4f32b3305157db033ce8e47648abefe82ad7ca8a2b1cd9d3a95
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.

5.108 × 10⁹⁶(97-digit number)
51080927447141657255…60256960948355261439
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
5.108 × 10⁹⁶(97-digit number)
51080927447141657255…60256960948355261439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.021 × 10⁹⁷(98-digit number)
10216185489428331451…20513921896710522879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.043 × 10⁹⁷(98-digit number)
20432370978856662902…41027843793421045759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.086 × 10⁹⁷(98-digit number)
40864741957713325804…82055687586842091519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.172 × 10⁹⁷(98-digit number)
81729483915426651608…64111375173684183039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.634 × 10⁹⁸(99-digit number)
16345896783085330321…28222750347368366079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.269 × 10⁹⁸(99-digit number)
32691793566170660643…56445500694736732159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.538 × 10⁹⁸(99-digit number)
65383587132341321286…12891001389473464319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.307 × 10⁹⁹(100-digit number)
13076717426468264257…25782002778946928639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.615 × 10⁹⁹(100-digit number)
26153434852936528514…51564005557893857279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.230 × 10⁹⁹(100-digit number)
52306869705873057029…03128011115787714559
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,728,806 XPM·at block #6,810,589 · 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