1. #6,807,926TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #878,427

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/1/2015, 10:01:17 PM · Difficulty 10.9632 · 5,929,499 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c5ba11877e21a82409c305eab5cec7db0ad791fa9b5a5bd9c700eaff59e652b3

Height

#878,427

Difficulty

10.963244

Transactions

2

Size

1.86 KB

Version

2

Bits

0af69722

Nonce

648,763,493

Timestamp

1/1/2015, 10:01:17 PM

Confirmations

5,929,499

Merkle Root

80fbb4ae1c7e94b7ed02a73228ab5289baeb14f7c64cf1b0c11bc68a07744dd3
Transactions (2)
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.668 × 10⁹⁴(95-digit number)
16680850675709361255…66320174455390543999
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.668 × 10⁹⁴(95-digit number)
16680850675709361255…66320174455390543999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.336 × 10⁹⁴(95-digit number)
33361701351418722511…32640348910781087999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.672 × 10⁹⁴(95-digit number)
66723402702837445022…65280697821562175999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.334 × 10⁹⁵(96-digit number)
13344680540567489004…30561395643124351999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.668 × 10⁹⁵(96-digit number)
26689361081134978008…61122791286248703999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.337 × 10⁹⁵(96-digit number)
53378722162269956017…22245582572497407999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.067 × 10⁹⁶(97-digit number)
10675744432453991203…44491165144994815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.135 × 10⁹⁶(97-digit number)
21351488864907982407…88982330289989631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.270 × 10⁹⁶(97-digit number)
42702977729815964814…77964660579979263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.540 × 10⁹⁶(97-digit number)
85405955459631929628…55929321159958527999
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,707,444 XPM·at block #6,807,925 · 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