Block #775,669

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/19/2014, 4:50:02 PM · Difficulty 10.9816 · 6,051,327 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3bca6e5a5a19a358234c111ba2881acfd489eacdc6608b609b40f2643d22c731

Height

#775,669

Difficulty

10.981627

Transactions

6

Size

2.32 KB

Version

2

Bits

0afb4be0

Nonce

2,321,538,017

Timestamp

10/19/2014, 4:50:02 PM

Confirmations

6,051,327

Merkle Root

4f44a60ed8f15a1f0cc5c14559f0bf8435196aec8d2d2f0f6857722ec744e06a
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.164 × 10⁹⁷(98-digit number)
91643461270752446139…20211264972506900479
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.164 × 10⁹⁷(98-digit number)
91643461270752446139…20211264972506900479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.832 × 10⁹⁸(99-digit number)
18328692254150489227…40422529945013800959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.665 × 10⁹⁸(99-digit number)
36657384508300978455…80845059890027601919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.331 × 10⁹⁸(99-digit number)
73314769016601956911…61690119780055203839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.466 × 10⁹⁹(100-digit number)
14662953803320391382…23380239560110407679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.932 × 10⁹⁹(100-digit number)
29325907606640782764…46760479120220815359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.865 × 10⁹⁹(100-digit number)
58651815213281565529…93520958240441630719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.173 × 10¹⁰⁰(101-digit number)
11730363042656313105…87041916480883261439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.346 × 10¹⁰⁰(101-digit number)
23460726085312626211…74083832961766522879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.692 × 10¹⁰⁰(101-digit number)
46921452170625252423…48167665923533045759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.384 × 10¹⁰⁰(101-digit number)
93842904341250504846…96335331847066091519
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,860,144 XPM·at block #6,826,995 · 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