Block #776,271

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/20/2014, 3:37:28 AM · Difficulty 10.9815 · 6,057,095 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
22552bbd1e2769751fec6a089123c7cbab1148ab92a4315240422611e267d20c

Height

#776,271

Difficulty

10.981472

Transactions

9

Size

2.59 KB

Version

2

Bits

0afb41c7

Nonce

463,051,193

Timestamp

10/20/2014, 3:37:28 AM

Confirmations

6,057,095

Merkle Root

e3cebfe548ad7bec7d0ff70399a6a30ea4f17176cdb37ef3ce8a46532cb103e1
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.384 × 10⁹³(94-digit number)
13845495646675544997…35509553031151067359
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.384 × 10⁹³(94-digit number)
13845495646675544997…35509553031151067359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.769 × 10⁹³(94-digit number)
27690991293351089994…71019106062302134719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.538 × 10⁹³(94-digit number)
55381982586702179988…42038212124604269439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.107 × 10⁹⁴(95-digit number)
11076396517340435997…84076424249208538879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.215 × 10⁹⁴(95-digit number)
22152793034680871995…68152848498417077759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.430 × 10⁹⁴(95-digit number)
44305586069361743990…36305696996834155519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.861 × 10⁹⁴(95-digit number)
88611172138723487980…72611393993668311039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.772 × 10⁹⁵(96-digit number)
17722234427744697596…45222787987336622079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.544 × 10⁹⁵(96-digit number)
35444468855489395192…90445575974673244159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.088 × 10⁹⁵(96-digit number)
70888937710978790384…80891151949346488319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.417 × 10⁹⁶(97-digit number)
14177787542195758076…61782303898692976639
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,911,125 XPM·at block #6,833,365 · 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