Block #378,038

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/27/2014, 1:06:42 PM · Difficulty 10.4206 · 6,431,815 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
580ff0a4f4016b33fc857a649ed2e652dd5ec1d45359233701d1fb53aa078c09

Height

#378,038

Difficulty

10.420585

Transactions

8

Size

2.25 KB

Version

2

Bits

0a6bab74

Nonce

6,173

Timestamp

1/27/2014, 1:06:42 PM

Confirmations

6,431,815

Merkle Root

2a43638a68e3099ef6e47f072582f54c2097a6333ef58925cfb0ad63e4c61b7b
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.

6.666 × 10¹⁰⁴(105-digit number)
66662972965682490971…01390483064257249279
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
6.666 × 10¹⁰⁴(105-digit number)
66662972965682490971…01390483064257249279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.333 × 10¹⁰⁵(106-digit number)
13332594593136498194…02780966128514498559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.666 × 10¹⁰⁵(106-digit number)
26665189186272996388…05561932257028997119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.333 × 10¹⁰⁵(106-digit number)
53330378372545992777…11123864514057994239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.066 × 10¹⁰⁶(107-digit number)
10666075674509198555…22247729028115988479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.133 × 10¹⁰⁶(107-digit number)
21332151349018397110…44495458056231976959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.266 × 10¹⁰⁶(107-digit number)
42664302698036794221…88990916112463953919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.532 × 10¹⁰⁶(107-digit number)
85328605396073588443…77981832224927907839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.706 × 10¹⁰⁷(108-digit number)
17065721079214717688…55963664449855815679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.413 × 10¹⁰⁷(108-digit number)
34131442158429435377…11927328899711631359
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,722,911 XPM·at block #6,809,852 · 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