Block #1,677,439

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/17/2016, 7:49:46 PM · Difficulty 10.6948 · 5,162,823 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b277456b77237aad797dbc5c096d945d3adefbf0bf5b35cd4a41ec4ffe568092

Height

#1,677,439

Difficulty

10.694847

Transactions

47

Size

17.00 KB

Version

2

Bits

0ab1e178

Nonce

569,090,914

Timestamp

7/17/2016, 7:49:46 PM

Confirmations

5,162,823

Merkle Root

5106ab40692f74bd5074cee1a3ad63b9bb1bc083d6de088406d263acd5e64462
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.

2.770 × 10⁹⁴(95-digit number)
27703755260961144580…36746849710144439601
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
2.770 × 10⁹⁴(95-digit number)
27703755260961144580…36746849710144439601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.540 × 10⁹⁴(95-digit number)
55407510521922289160…73493699420288879201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.108 × 10⁹⁵(96-digit number)
11081502104384457832…46987398840577758401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.216 × 10⁹⁵(96-digit number)
22163004208768915664…93974797681155516801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.432 × 10⁹⁵(96-digit number)
44326008417537831328…87949595362311033601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.865 × 10⁹⁵(96-digit number)
88652016835075662657…75899190724622067201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.773 × 10⁹⁶(97-digit number)
17730403367015132531…51798381449244134401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.546 × 10⁹⁶(97-digit number)
35460806734030265062…03596762898488268801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.092 × 10⁹⁶(97-digit number)
70921613468060530125…07193525796976537601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.418 × 10⁹⁷(98-digit number)
14184322693612106025…14387051593953075201
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 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
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 2CC formula:

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