Block #772,417

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/17/2014, 9:40:57 AM · Difficulty 10.9817 · 6,034,733 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ef554f7bf7b7c897b4f0e625dc3a39fea544a259b4cf94243d0002eeaffe7a6b

Height

#772,417

Difficulty

10.981736

Transactions

12

Size

3.35 KB

Version

2

Bits

0afb530a

Nonce

1,178,776,616

Timestamp

10/17/2014, 9:40:57 AM

Confirmations

6,034,733

Merkle Root

2686d686f99f99b4122232bb622d1d452a4c3148526b52748682be6387cbfd7a
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.232 × 10⁹⁶(97-digit number)
92323437584461750691…95983298275818723361
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.232 × 10⁹⁶(97-digit number)
92323437584461750691…95983298275818723361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.846 × 10⁹⁷(98-digit number)
18464687516892350138…91966596551637446721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.692 × 10⁹⁷(98-digit number)
36929375033784700276…83933193103274893441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.385 × 10⁹⁷(98-digit number)
73858750067569400553…67866386206549786881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.477 × 10⁹⁸(99-digit number)
14771750013513880110…35732772413099573761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.954 × 10⁹⁸(99-digit number)
29543500027027760221…71465544826199147521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.908 × 10⁹⁸(99-digit number)
59087000054055520442…42931089652398295041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.181 × 10⁹⁹(100-digit number)
11817400010811104088…85862179304796590081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.363 × 10⁹⁹(100-digit number)
23634800021622208176…71724358609593180161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.726 × 10⁹⁹(100-digit number)
47269600043244416353…43448717219186360321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.453 × 10⁹⁹(100-digit number)
94539200086488832707…86897434438372720641
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,701,206 XPM·at block #6,807,149 · 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