1. #6,806,653TWN11 primes

    Bi-Twin · ⛏️ coinsforall.io

Block #437,869

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/10/2014, 2:22:48 PM · Difficulty 10.3604 · 6,368,785 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6a3b93c621f86fbdf79a68edba0aa0f43a12e70eacc7f987751b0832e43bfad1

Height

#437,869

Difficulty

10.360362

Transactions

7

Size

1.52 KB

Version

2

Bits

0a5c40b3

Nonce

105,351

Timestamp

3/10/2014, 2:22:48 PM

Confirmations

6,368,785

Merkle Root

f7e2d8459d1d4ae9f5b858cef66e4feabae0f05e4efa1a7b0ad5b5ba77c40866
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.010 × 10⁹⁹(100-digit number)
20105613139131970712…76801510791723442559
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.010 × 10⁹⁹(100-digit number)
20105613139131970712…76801510791723442559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.021 × 10⁹⁹(100-digit number)
40211226278263941425…53603021583446885119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.042 × 10⁹⁹(100-digit number)
80422452556527882851…07206043166893770239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.608 × 10¹⁰⁰(101-digit number)
16084490511305576570…14412086333787540479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.216 × 10¹⁰⁰(101-digit number)
32168981022611153140…28824172667575080959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.433 × 10¹⁰⁰(101-digit number)
64337962045222306281…57648345335150161919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.286 × 10¹⁰¹(102-digit number)
12867592409044461256…15296690670300323839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.573 × 10¹⁰¹(102-digit number)
25735184818088922512…30593381340600647679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.147 × 10¹⁰¹(102-digit number)
51470369636177845025…61186762681201295359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.029 × 10¹⁰²(103-digit number)
10294073927235569005…22373525362402590719
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,697,328 XPM·at block #6,806,653 · 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