Block #674,111

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/12/2014, 1:05:55 AM · Difficulty 10.9653 · 6,133,036 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1b8735e0aba0ebf2ff3f8f6c3e934f079c1af6bb88f573701810ca3e3db17972

Height

#674,111

Difficulty

10.965285

Transactions

8

Size

15.61 KB

Version

2

Bits

0af71cec

Nonce

1,352,119,479

Timestamp

8/12/2014, 1:05:55 AM

Confirmations

6,133,036

Merkle Root

03e852a40d06501cd21acdf2abbeaac67369ded10b48c0fe1ce45eb22c67aff2
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.155 × 10⁹⁵(96-digit number)
31551445216180750419…51380526309819935999
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.155 × 10⁹⁵(96-digit number)
31551445216180750419…51380526309819935999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.310 × 10⁹⁵(96-digit number)
63102890432361500839…02761052619639871999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.262 × 10⁹⁶(97-digit number)
12620578086472300167…05522105239279743999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.524 × 10⁹⁶(97-digit number)
25241156172944600335…11044210478559487999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.048 × 10⁹⁶(97-digit number)
50482312345889200671…22088420957118975999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.009 × 10⁹⁷(98-digit number)
10096462469177840134…44176841914237951999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.019 × 10⁹⁷(98-digit number)
20192924938355680268…88353683828475903999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.038 × 10⁹⁷(98-digit number)
40385849876711360537…76707367656951807999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.077 × 10⁹⁷(98-digit number)
80771699753422721074…53414735313903615999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.615 × 10⁹⁸(99-digit number)
16154339950684544214…06829470627807231999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.230 × 10⁹⁸(99-digit number)
32308679901369088429…13658941255614463999
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,701,182 XPM·at block #6,807,146 · 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