Block #679,010

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/15/2014, 3:44:27 PM · Difficulty 10.9633 · 6,127,525 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9f16629553268000de0e60f3f15c6ba5f28b4bfe8dbbb257ed538505122f5679

Height

#679,010

Difficulty

10.963339

Transactions

4

Size

1.01 KB

Version

2

Bits

0af69d5b

Nonce

723,399,458

Timestamp

8/15/2014, 3:44:27 PM

Confirmations

6,127,525

Merkle Root

95df3ab2bc932630c06e408d308f92673c0aa18f343c3f05d415757aeb875e48
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.729 × 10⁹⁸(99-digit number)
37298176141065359741…48837973557603481601
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.729 × 10⁹⁸(99-digit number)
37298176141065359741…48837973557603481601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.459 × 10⁹⁸(99-digit number)
74596352282130719482…97675947115206963201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.491 × 10⁹⁹(100-digit number)
14919270456426143896…95351894230413926401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.983 × 10⁹⁹(100-digit number)
29838540912852287792…90703788460827852801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.967 × 10⁹⁹(100-digit number)
59677081825704575585…81407576921655705601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.193 × 10¹⁰⁰(101-digit number)
11935416365140915117…62815153843311411201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.387 × 10¹⁰⁰(101-digit number)
23870832730281830234…25630307686622822401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.774 × 10¹⁰⁰(101-digit number)
47741665460563660468…51260615373245644801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.548 × 10¹⁰⁰(101-digit number)
95483330921127320937…02521230746491289601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.909 × 10¹⁰¹(102-digit number)
19096666184225464187…05042461492982579201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.819 × 10¹⁰¹(102-digit number)
38193332368450928374…10084922985965158401
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 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
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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,696,380 XPM·at block #6,806,534 · 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