1. #6,816,305TWN10 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #549,598

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/17/2014, 3:57:23 PM · Difficulty 10.9610 · 6,266,708 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
29da9eec08d2ec6277dac2846fe8ab082f60a85d3cc982d54fd488ea2c04f7e4

Height

#549,598

Difficulty

10.960990

Transactions

8

Size

2.04 KB

Version

2

Bits

0af60372

Nonce

9,503,813

Timestamp

5/17/2014, 3:57:23 PM

Confirmations

6,266,708

Merkle Root

8c8174f350c753db2b22ea8d873bf0da233bb64c21a8be1806ead737f1229d21
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.706 × 10⁹⁹(100-digit number)
17061488411965617774…99192451695439784961
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.706 × 10⁹⁹(100-digit number)
17061488411965617774…99192451695439784961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.412 × 10⁹⁹(100-digit number)
34122976823931235549…98384903390879569921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.824 × 10⁹⁹(100-digit number)
68245953647862471099…96769806781759139841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.364 × 10¹⁰⁰(101-digit number)
13649190729572494219…93539613563518279681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.729 × 10¹⁰⁰(101-digit number)
27298381459144988439…87079227127036559361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.459 × 10¹⁰⁰(101-digit number)
54596762918289976879…74158454254073118721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.091 × 10¹⁰¹(102-digit number)
10919352583657995375…48316908508146237441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.183 × 10¹⁰¹(102-digit number)
21838705167315990751…96633817016292474881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.367 × 10¹⁰¹(102-digit number)
43677410334631981503…93267634032584949761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.735 × 10¹⁰¹(102-digit number)
87354820669263963007…86535268065169899521
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,774,568 XPM·at block #6,816,305 · 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