Block #473,589

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/4/2014, 12:25:04 AM · Difficulty 10.4469 · 6,337,410 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c36adb378c58074b0b3590c90e9a5f0bcd2758339b0e46d0e9bbfafb1812cf06

Height

#473,589

Difficulty

10.446941

Transactions

4

Size

1.27 KB

Version

2

Bits

0a726ab9

Nonce

304,161

Timestamp

4/4/2014, 12:25:04 AM

Confirmations

6,337,410

Merkle Root

3641e93f1518335db43e3c62fbfb7ee1975aa1b4c86052c4af375ffc51865885
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.955 × 10⁹⁹(100-digit number)
19553272709416751359…19556706846058455039
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.955 × 10⁹⁹(100-digit number)
19553272709416751359…19556706846058455039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.910 × 10⁹⁹(100-digit number)
39106545418833502719…39113413692116910079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.821 × 10⁹⁹(100-digit number)
78213090837667005438…78226827384233820159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.564 × 10¹⁰⁰(101-digit number)
15642618167533401087…56453654768467640319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.128 × 10¹⁰⁰(101-digit number)
31285236335066802175…12907309536935280639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.257 × 10¹⁰⁰(101-digit number)
62570472670133604350…25814619073870561279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.251 × 10¹⁰¹(102-digit number)
12514094534026720870…51629238147741122559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.502 × 10¹⁰¹(102-digit number)
25028189068053441740…03258476295482245119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.005 × 10¹⁰¹(102-digit number)
50056378136106883480…06516952590964490239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.001 × 10¹⁰²(103-digit number)
10011275627221376696…13033905181928980479
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,732,095 XPM·at block #6,810,998 · 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