Block #808,683

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 11/13/2014, 1:31:55 AM · Difficulty 10.9735 · 6,007,373 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0c84b6c4660b39738ba3765cdf4dd273d0963a85c265f0dbc93be8d8cd833eeb

Height

#808,683

Difficulty

10.973518

Transactions

6

Size

3.29 KB

Version

2

Bits

0af93872

Nonce

2,228,628,263

Timestamp

11/13/2014, 1:31:55 AM

Confirmations

6,007,373

Merkle Root

3e243ea7641693c3440b637244cfb3cb0a51d32cf3fd350f84f12314de830527
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.

3.460 × 10⁹⁴(95-digit number)
34609512653542996694…15048881863723662479
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
3.460 × 10⁹⁴(95-digit number)
34609512653542996694…15048881863723662479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.921 × 10⁹⁴(95-digit number)
69219025307085993388…30097763727447324959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.384 × 10⁹⁵(96-digit number)
13843805061417198677…60195527454894649919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.768 × 10⁹⁵(96-digit number)
27687610122834397355…20391054909789299839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.537 × 10⁹⁵(96-digit number)
55375220245668794710…40782109819578599679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.107 × 10⁹⁶(97-digit number)
11075044049133758942…81564219639157199359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.215 × 10⁹⁶(97-digit number)
22150088098267517884…63128439278314398719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.430 × 10⁹⁶(97-digit number)
44300176196535035768…26256878556628797439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.860 × 10⁹⁶(97-digit number)
88600352393070071537…52513757113257594879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.772 × 10⁹⁷(98-digit number)
17720070478614014307…05027514226515189759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.544 × 10⁹⁷(98-digit number)
35440140957228028614…10055028453030379519
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,772,563 XPM·at block #6,816,055 · 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