1. #6,808,727TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #369,726

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/21/2014, 2:26:19 PM · Difficulty 10.4474 · 6,439,002 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
424143b7528815b24331ff895ef0c473760c7c3a7813384c3117b7feb2369ba9

Height

#369,726

Difficulty

10.447362

Transactions

4

Size

6.05 KB

Version

2

Bits

0a728655

Nonce

324,317

Timestamp

1/21/2014, 2:26:19 PM

Confirmations

6,439,002

Merkle Root

834bd1fb286a454df9ed85dfbf101b82170a1cb4de1302f52530b0577428acfa
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.

5.594 × 10⁹³(94-digit number)
55949782685148869605…83413543900129196639
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
5.594 × 10⁹³(94-digit number)
55949782685148869605…83413543900129196639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.118 × 10⁹⁴(95-digit number)
11189956537029773921…66827087800258393279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.237 × 10⁹⁴(95-digit number)
22379913074059547842…33654175600516786559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.475 × 10⁹⁴(95-digit number)
44759826148119095684…67308351201033573119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.951 × 10⁹⁴(95-digit number)
89519652296238191369…34616702402067146239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.790 × 10⁹⁵(96-digit number)
17903930459247638273…69233404804134292479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.580 × 10⁹⁵(96-digit number)
35807860918495276547…38466809608268584959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.161 × 10⁹⁵(96-digit number)
71615721836990553095…76933619216537169919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.432 × 10⁹⁶(97-digit number)
14323144367398110619…53867238433074339839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.864 × 10⁹⁶(97-digit number)
28646288734796221238…07734476866148679679
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,713,870 XPM·at block #6,808,727 · 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