1. #6,812,948TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #504,929

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/22/2014, 2:48:09 AM · Difficulty 10.8098 · 6,308,020 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f5d22b074fee74c083d75e7f12172856aa387d2d853073df1607dffebe3efc0f

Height

#504,929

Difficulty

10.809818

Transactions

4

Size

1.04 KB

Version

2

Bits

0acf503b

Nonce

1,080,129

Timestamp

4/22/2014, 2:48:09 AM

Confirmations

6,308,020

Merkle Root

6331110b10b60aae560b5b1255ce54b61ac048c1bb372697e562a3fcaa1a2049
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.529 × 10⁹⁹(100-digit number)
15294559868482372800…39994004341660524319
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.529 × 10⁹⁹(100-digit number)
15294559868482372800…39994004341660524319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.058 × 10⁹⁹(100-digit number)
30589119736964745601…79988008683321048639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.117 × 10⁹⁹(100-digit number)
61178239473929491203…59976017366642097279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.223 × 10¹⁰⁰(101-digit number)
12235647894785898240…19952034733284194559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.447 × 10¹⁰⁰(101-digit number)
24471295789571796481…39904069466568389119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.894 × 10¹⁰⁰(101-digit number)
48942591579143592963…79808138933136778239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.788 × 10¹⁰⁰(101-digit number)
97885183158287185926…59616277866273556479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.957 × 10¹⁰¹(102-digit number)
19577036631657437185…19232555732547112959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.915 × 10¹⁰¹(102-digit number)
39154073263314874370…38465111465094225919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.830 × 10¹⁰¹(102-digit number)
78308146526629748740…76930222930188451839
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,747,632 XPM·at block #6,812,948 · 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