Block #684,280

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/19/2014, 7:32:45 PM · Difficulty 10.9579 · 6,130,800 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fadfe15cf7829c35b1f70b9538b6b81f2af2edbf67d65e2d206506eb9da38689

Height

#684,280

Difficulty

10.957899

Transactions

7

Size

3.55 KB

Version

2

Bits

0af538d7

Nonce

67,472,099

Timestamp

8/19/2014, 7:32:45 PM

Confirmations

6,130,800

Merkle Root

200585c243e46b0a9cdeecf65b73a7b6805d9a0e929da892c298b013be88b192
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.433 × 10⁹⁶(97-digit number)
14332193581337652181…56592419478601697959
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.433 × 10⁹⁶(97-digit number)
14332193581337652181…56592419478601697959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.866 × 10⁹⁶(97-digit number)
28664387162675304363…13184838957203395919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.732 × 10⁹⁶(97-digit number)
57328774325350608726…26369677914406791839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.146 × 10⁹⁷(98-digit number)
11465754865070121745…52739355828813583679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.293 × 10⁹⁷(98-digit number)
22931509730140243490…05478711657627167359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.586 × 10⁹⁷(98-digit number)
45863019460280486981…10957423315254334719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.172 × 10⁹⁷(98-digit number)
91726038920560973962…21914846630508669439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.834 × 10⁹⁸(99-digit number)
18345207784112194792…43829693261017338879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.669 × 10⁹⁸(99-digit number)
36690415568224389585…87659386522034677759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.338 × 10⁹⁸(99-digit number)
73380831136448779170…75318773044069355519
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 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
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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,764,726 XPM·at block #6,815,079 · 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