Re: [sage-devel] Re: Question about cysignals installation

2023-08-16 Thread 'Martin R. Albrecht' via sage-devel
FWIW this PR https://github.com/sagemath/cysignals/pull/174 does this porting, I think. CI complaints but I don’t understand the complaint. On Wed, Aug 16 2023, Dima Pasechnik wrote: > I think your cython is too new (3.0.0). > > Cysignals has not been ported to it yet. > > On Wednesday, August 1

Re: [sage-devel] fpylll really slow in sage9.x, when compared to sage8.x

2023-01-11 Thread 'Martin R. Albrecht' via sage-devel
Thanks, it’s this function and a similar one the other way, i.e. an FPyLLL issue when used inside Sage: ``` cdef int assign_mpz(mpz_t& t, value) except -1: """ Assign Python integer to Z_NR[mpz_t] """ if isinstance(value, int) and PY_MAJOR_VERSION == 2: mpz_set_si(t,

Re: [sage-devel] fpylll really slow in sage9.x, when compared to sage8.x

2023-01-10 Thread 'Martin R. Albrecht' via sage-devel
Hi there, I don’t think A*B is a good benchmark for FPyLLL does the same slowdown also appear for, say, LLL? Cheers, Martin On Tue, Jan 10 2023, 'Julian Nowakowski' via sage-devel wrote: > Hi all, > > we recently noticed that the IntegerMatrix class from fpylll is (on our > hardware) much slow

Re: [sage-devel] VOTE: move Sage development to Github

2022-09-22 Thread 'Martin R. Albrecht' via sage-devel
+1 for GitHub On Wed, Sep 21 2022, David Roe wrote: > Dear Sage developers, > Following extensive discussion, both recently > > (prompted > by issues upgrading the trac server) and over >

[sage-devel] M1?

2022-03-03 Thread 'Martin R. Albrecht' via sage-devel
Hi there, Do “we” (in some broad, fuzzy sense) have SSH-able access to an M1? M4RIE (included in Sage) is reportedly acting up on those: https://bitbucket.org/malb/m4rie/issues/23/trying-to-compile-on-apple-m1 Cheers, Martin -- _pgp: https://keybase.io/martinralbrecht _www: https://malb.io _

[sage-devel] M4RIE testing on Apple M1?

2022-01-24 Thread 'Martin R. Albrecht' via sage-devel
Hi there, There’s a bug report about Sage’s linear algebra over GF(2^e) here: https://trac.sagemath.org/ticket/33212 which seems to boil down to a problem M4RIE on Apple M1s: https://bitbucket.org/malb/m4rie/issues/23/trying-to-compile-on-apple-m1 Could someone with an Apple M1 compile and ‘ma

[sage-devel] Virtual FPLLL Days 6: 19/20 November

2020-11-03 Thread 'Martin R. Albrecht' via sage-devel
Hi there, We’ll be hold the 6th FPLLL Days (inspired by Sage Days) on 19/20 November. https://github.com/fplll/fplll/wiki/Virtual-FPLLL-Days-6-aka-Bounded-Distance-Development FPLLL is a lattice reduction library that powers Sage’s lattice reduction, among other things, see https://github.com/f

Re: [sage-devel] Unimodular transformation matrix of LLL algorithm

2020-10-01 Thread 'Martin R. Albrecht' via sage-devel
ice reduction takes 49 seconds in the first case and 7 seconds in the > second case. > Maybe I am missing something. > > Best regards, > Santanu > > On Tue, 29 Sep 2020 at 09:01, 'Martin R. Albrecht' via sage-devel < > sage-devel@googlegroups.com> wrote: >

Re: [sage-devel] Unimodular transformation matrix of LLL algorithm

2020-09-28 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
> On Sun, 27 Sep 2020 at 20:45, 'Martin R. Albrecht' via sage-devel < > sage-devel@googlegroups.com> wrote: > >> Hi there, >> >> This should do the trick: >> >> sage: from fpylll import * >> sage: A = random_matrix(ZZ, 6, 90) >> sage:

Re: [sage-devel] Unimodular transformation matrix of LLL algorithm

2020-09-27 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi there, This should do the trick: sage: from fpylll import * sage: A = random_matrix(ZZ, 6, 90) sage: U = IntegerMatrix.identity(6) sage: B = LLL.reduction(IntegerMatrix.from_matrix(A), U).to_matrix(matrix(ZZ, 6, 90)) sage: U = U.to_matrix(matrix(ZZ, 6,6)) sage: B == U*A True sage: abs(U.det())

Re: [sage-devel] Re: #28664 (Lattice Reduction Strategies in Sage binaries)

2019-11-19 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi all, A follow up: I ran $ git clone https://github.com/sagemath/binary-pkg.git $ cd binary-pkg $ make bdist-sage-linux $ cd .. $ unp binary-pkg/dist/sage-9.0.beta6-Debian_GNU_Linux_9-x86_64.tar.bz2 $ cd SageMath $ ./sage (watch the patching going on) sage: from fpylll import * sage: BKZ.DEFA

Re: [sage-devel] Re: #28664 (Lattice Reduction Strategies in Sage binaries)

2019-11-18 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi Nils, Thanks, this is helpful. Is there a straight-forward way in which I can trigger the relocation, I’m trying to test what goes wrong, so: 1/ I built sage from source, all works as expected 2a/ I move the installation, Sage barks at me. 2b/ However, just starting python from the relocated

[sage-devel] #28664 (Lattice Reduction Strategies in Sage binaries)

2019-11-18 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi all, At https://trac.sagemath.org/ticket/28664 I’m/we’re confronted with a bug where I’m not sure how to make progress. Essentially, if you build Sage from source, all is well. But if you use the binaries provided then lattice reduction reverts to something really really slow by being unabl

Re: [sage-devel] Re: Anyone used SBox.interpolation_polynomial?

2019-01-03 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi there, I probably wrote the code and the documentation (?) but I haven’t used either in a while. If it’s all the same, perhaps keeping the current behaviour (and changing the documentation) is the strategy of least surprise? Cheers, Martin Travis Scrimshaw writes: > Anyone have any though

Re: [sage-devel] Re: how to use a singular lib

2018-11-23 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Indeed, this should work: _ = sage.libs.singular.function.lib("symodstd.lib") syModStd = sage.libs.singular.function.singular_function("syModStd") Simon King writes: > Hi Daniel, > > On 2018-11-23, Daniel Krenn wrote: >> Singular is shipped with symodstd.lib (it contains an algorithm for >> co

Re: [sage-devel] A Sage interface for FGb (Gröbner bases)

2018-11-23 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
parisse writes: > Le jeudi 22 novembre 2018 10:11:39 UTC+1, Thierry (sage-googlesucks@xxx) a > écrit : >> >> Hi, >> >> >> It was on my todo list for a while too, since our implementations are very >> slow. Here "very" means "prohibitively", since some systems can not be >> solved with Sage

Re: [sage-devel] A Sage interface for FGb (Gröbner bases)

2018-11-22 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi Markus, Works without a hitch here (Debian/testing, Sage 8.4). I have been planning on doing this over the years but never got around to it, so really cool to see that you did. Nice work! Cheers, Martin Markus Wageringel writes: > Hi everyone. > > I created a Sage wrapper for the C interf

Re: [sage-devel] Representation of LinearLayers in the crypto module

2018-07-06 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi Friedrich, I was thinking maybe something like this: from sage.matrix.matrix_mod2_dense import Matrix_mod2_dense, from sage.matrix.matrix_gf2e_dense import Matrix_gf2e_dense class LinearLayer: def foo(self): return self[0, 1] def LinearLayerFactory(K): if K.characteristic()

Re: [sage-devel] What does MPolynomial_libsingular.reduce() do?

2017-10-17 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi there, I’m fairly certain that I wrote that code or was at least involved since I wrote most of the first version of the libsingular stuff, David’s commit output by `git blame` is a merge commit. The algorithm in question is described in “Ideals, Varieties, and Algorithms” by David Cox, J

Re: [sage-devel] What does MPolynomial_libsingular.reduce() do?

2017-10-17 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi there, AFAIK if you do that you prevent high-level implementation of Gröbner basis algorithms in Sage which call reduce, i.e. polynomial division with remainders, on S-polynomials wrt to the current basis. Cheers, Martin Daniel Krenn writes: On 2017-10-17 11:49, Luca De Feo wrote: It t

Re: [sage-devel] What does MPolynomial_libsingular.reduce() do?

2017-10-16 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi there, this is already documented: “ Return the normal form of self w.r.t. "I", i.e. return the remainder of this polynomial with respect to the polynomials in "I". If the polynomial set/list "I" is not a (strong) Groebner basis the result is not canonical. ” Cheers, Martin Daniel Kre

Re: [sage-devel] 7.4 release: please don't have fpylll build-depend on Sage

2016-10-19 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi all, this is now https://trac.sagemath.org/ticket/21728 Cheers, Martin Martin R. Albrecht writes: > Hi there, > > Ximin Luo writes: >> We can do "pre-install tests" with Sage 7.3, by doing a "dummy >> install" using Sage's Makefiles, running the tests here, then >> installing them to the "re

Re: [sage-devel] 7.4 release: please don't have fpylll build-depend on Sage

2016-10-18 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi there, Ximin Luo writes: > We can do "pre-install tests" with Sage 7.3, by doing a "dummy > install" using Sage's Makefiles, running the tests here, then > installing them to the "real location". (This requires some patching, > but we have achieved this already and it works.) However with Sage

Re: [sage-devel] fplll 5.0 in sage

2016-08-11 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
This is now https://trac.sagemath.org/ticket/21221 Cheers, Martin Jean-Pierre Flori writes: > Yes! > > Did you open a ticket for this? -- _pgp: https://keybase.io/martinralbrecht _www: https://martinralbrecht.wordpress.com _jab: martinralbre...@jabber.ccc.de _otr: 47F43D1A 5D68C36F 468BAEB

[sage-devel] fplll 5.0 in sage

2016-08-05 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi Sage developers, *tl;dr* Fplll 5.0 is about to hit the streets. It’s a major improvement over Fplll 4.* which we currently ship with Sage. To update we need to change the user interface of the function `IntegerMatrix.BKZ`. I suggest to drop Sage’s own interface to Fplll in favour of the offi

[sage-devel] fplll upgrade review

2016-03-31 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi there, anybody up for reviewing http://trac.sagemath.org/ticket/20291 which upgrades fplll to the current upstream master. This enables to install fpylll[1] in Sage, which is a much nicer Python interface for lattice-reduction than what Sage currently has (optional package in preparation.)

[sage-devel] Re: interrupt.pyx on PyPi?

2016-02-06 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi all, work on this has started: https://github.com/malb/signal.pyx http://trac.sagemath.org/ticket/20002 So far, it’s pretty standard setup.py stuff, i.e. no autoconf. Help welcome: https://github.com/malb/signal.pyx/issues Cheers, Martin Martin R. Albrecht writes: > Hi all, > > In

Re: [sage-devel] interrupt.pyx on PyPi?

2016-02-02 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Jean-Pierre Flori writes: > "cygnals"? +1 -- _pgp: https://keybase.io/martinralbrecht _www: https://martinralbrecht.wordpress.com _jab: martinralbre...@jabber.ccc.de _otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF -- You received this message because you are subscribed to the Google Group

Re: [sage-devel] interrupt.pyx on PyPi?

2016-02-02 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi Jeroen, my concern is mainly of convention: I don’t think people expect pip to install shared libraries. Also, virtual environments tend not to set LD_LIBRARY_PATH but many people use pip with virtualenvs. Cheers, Martin Jeroen Demeyer writes: > On 2016-02-02 10:16, 'Martin R. Albre

Re: [sage-devel] interrupt.pyx on PyPi?

2016-02-02 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
I guess this ends my plan to just pip install -r requirements.txt it. But it makes sense. This is now http://trac.sagemath.org/ticket/20002 libcynterupt? Cheers, Martin Volker Braun writes: > The system-specific part could be a separate C library "libinterrupt" that > the python package de

Re: [sage-devel] Re: interrupt.pyx on PyPi?

2016-02-02 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi Volker, I’m not sure I follow. Many Python packages have tests, pick your favourite Python testing framework. Why should this be a problem here? In addition, Sage can/should run its own doctests to check there’s no mismatch. Cheers, Martin Volker Braun writes: > On Monday, February 1, 2016 at

Re: [sage-devel] interrupt.pyx on PyPi?

2016-02-01 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi Jeroen, Jeroen Demeyer writes: > On 2016-02-01 10:40, 'Martin R. Albrecht' via sage-devel wrote: >> In particular, I am *very* interested in turning Sage’s interrupt >> handling into something that can be easily installed from PyPI. For >> those who don’t know

Re: [sage-devel] Can anyone provide access to recent Intel or AMD machines?

2016-02-01 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi Bill, we got 16 cores (w/o HT) of Intel(R) Xeon(R) CPU E5-2667 v2 @ 3.30GHz here. If that helps, let me know off list and I can grant Alex access. Cheers, Martin 'Bill Hart' via sage-devel writes: > Hi all, > > today Alex Best started in Kaiserslautern on this OpenDreamKit project. > He's

[sage-devel] interrupt.pyx on PyPi?

2016-02-01 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi all, In a thread over at [sage-support] William wrote: > I've suggested numerous times that we should massively refactor the > sage library to be a bunch of smaller Python libraries, develop them > say on github (?), use Pypi and pip. If people would realize how > important it is that we revamp

[sage-devel] Re: [sage-support] building Software Carpentry "lesson" for Sagemath

2016-01-22 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi Dima, I’m not sure how much time I can contribute, but I’m in principle interested and would appreciate being kept in the loop. Cheers, Martin Dima Pasechnik writes: > Software Carpentry, see http://software-carpentry.org, is a charity that > does "Teaching basic lab skills for research comp

Re: [sage-devel] modulo operators (integers, rationals, real numbers)

2015-12-22 Thread &#x27;Martin R. Albrecht&#x27; via sage-devel
Hi sage-devel, I think 1) should be the default but I find myself needing 2) quite a bit these days (also for integers) Cheers, Martin Vincent Delecroix writes: > Hello, > > While responding to this ask question > > http://ask.sagemath.org/question/31740/why-112321-and-111320 > > I discovered so