Hello, I was just thinking about this, and I was wondering, can you hash an arbitrary Guile object? And if so, what do you hash? (I mean, algorithms like SHA-1 are defined on sequences of bits, as I understand it. So what collection of bits do you hash?) And is the hash recursive? (I.e. is it an equal?-hash, an eqv?-hash, or an eq?-hash.)
If I understand the conversation correctly, the answer is yes, and that you hash the bit representation that Guile uses internally, and it is an equal?-hash. Is that accurate? Thanks, Noah On Mon, Feb 4, 2013 at 9:43 PM, Nala Ginrut <nalagin...@gmail.com> wrote: > On Tue, 2013-02-05 at 00:03 +0100, Ludovic Courtès wrote: > > Nala Ginrut <nalagin...@gmail.com> skribis: > > > > > As mentioned in another thread about digest algorithm support in Guile, > > > my plan is use part of implementation of libgcrypt and make a wrapper, > > > then put into libguile. > > > > We probably don’t want Guile to depend on libgcrypt. > > > > No, I didn't mean to use libgcrypt directly, I just suggested reuse part > of libgcrypt code(only the common digest algorithm) and make wrapper, > then put the C code in libguile. > > > So, instead, I’d suggest choosing the best of the 10 gcrypt FFI bindings > > already mentioned ;-), and putting it in the guildhall. > > > > If you want to go further, you (or its authors) could submit it for > > inclusion in libgcrypt proper. > > > > The gcrypt-guile project is doing so, I'll help it if I can. > But my original thought is orthogonal with gcrypt-guile, just put some > common digest algorithm in libguile rather than a full-stack crypto-lib. > > My suggest opposed by many guys, since they don't think md5/sha are very > common things. ;-) > But I'm dealing with server & web framework development, so I need > digest so much, and maybe it's no so common. > I'll let this topic alone, till others found they have same > requirements, or just forget about it. ;-D > > > Thanks, > > Ludo’. > > > > > > > >
