Block #768,790

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/15/2014, 8:05:18 AM · Difficulty 10.9791 · 6,042,314 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1cb3612878129775d3709a041608ac620c897e10c65b00dcee41f2acb20a19ab

Height

#768,790

Difficulty

10.979098

Transactions

2

Size

910 B

Version

2

Bits

0afaa62f

Nonce

17,873,530

Timestamp

10/15/2014, 8:05:18 AM

Confirmations

6,042,314

Merkle Root

6454132e6ad917d37e4d56bf68b86136a4a3bf41343fbe1137f5b55b9179b830
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.

1.408 × 10⁹⁵(96-digit number)
14082839190882681492…65590112343570940321
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
1.408 × 10⁹⁵(96-digit number)
14082839190882681492…65590112343570940321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.816 × 10⁹⁵(96-digit number)
28165678381765362985…31180224687141880641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.633 × 10⁹⁵(96-digit number)
56331356763530725970…62360449374283761281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.126 × 10⁹⁶(97-digit number)
11266271352706145194…24720898748567522561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.253 × 10⁹⁶(97-digit number)
22532542705412290388…49441797497135045121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.506 × 10⁹⁶(97-digit number)
45065085410824580776…98883594994270090241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.013 × 10⁹⁶(97-digit number)
90130170821649161552…97767189988540180481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.802 × 10⁹⁷(98-digit number)
18026034164329832310…95534379977080360961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.605 × 10⁹⁷(98-digit number)
36052068328659664620…91068759954160721921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.210 × 10⁹⁷(98-digit number)
72104136657319329241…82137519908321443841
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,732,939 XPM·at block #6,811,103 · 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